Given the following data records that includes the employee’s full name, Job, and the salary. The institute has decided to award the instructors a bonus of 200 due to their efforts during the pandemic. Adam Saleet, IT Support,1000 Naji Shemmari, Registrar,1250 Bilal Tweijari, Instructor,2000 Abdallah Mazem, Accountant,1000 Nizar Hachem, Instructor,1800 Nawwara Sleiman, Admission,900 Ameen Sinjer, QA Officer,1400 Walaa Saeed, Instructor,1900 Hamid Shami, IT Support,850 Nadine Khattar, Instructor, 1480 Using “csv”, “table_utils”, and “statistics” libraries, you are asked to do the following: a- Create a text file, SP21-Emp1.txt, and copy the above contents to it.3 b- Write a python program that does the following: 1- Read the contents of the file SP21-Emp1.txt into a list. 2- Extract the salaries into a new list. 2- For each instructor, you should add 200 to their salary. 3- Each name should also be split into first and last. 4- Using “statistics” library, calculate the mean and median of the salaries. 5- Print the records of the employees followed by the mean and the median as shown below in the expected output. 6- Include proper screenshots of the code and the output. Important Notes: 1- You can use only two Lists. 2- The whole program should include one loop and one If statement. 3- The format of the output should be identical to the given one. 4- The screenshots should also show part of your desktop in addition to the code/output

For all machines-not just hammers- the user applies force force to the machine to the machine over a certain distance. a. input b. output c. duo d. none of the above

We as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i.e. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix.write a program that takes an “infix” expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % (example infix expression: (7 - 3) / (2 + 2)postfix expression: 7 3 - 2 2 + /result: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';

When you mouse over and click to add a search term this(these) boolean operator(s) is(are) not implied. (select all that apply)?