Please show all steps and parts!

Consider a computer system in which four processes P1, P2, P3 and P4 must execute. The execution times for these processes are 4, 7,2 and 2 seconds, respectively. These processes do not arrive at the same time. The arrival times are 0, 2.01, 3.01, and 3.02 seconds. Analyze the execution and compute the turn-around time (response time) for each process and the wait time for each process when each of the following scheduling policies are used: a. First-come-first served b. Shortest Job First c. Shortest Remaining Job d. Round-Robin with time-slice 2 seconds e. Round-Robin with time-slice 1 second