DO NOT COPY FROM ANY OTHER CHGG QUESTION, IT'S WRONG Please answer the whole question (part a &b) below, could you also give the formulas that are used to find the finish , repsonse and turnaround time.

1. Consider the following process A,B,C, and D with arrival times, processing times (i.e., burst time), and deadlines as given in the following table. The deadline is the time when a process is expected to complete. (a) Compute the finish time, response time, and turnaround time for each process for the following CPU scheduling algorithms. Please answer the finish time, response time, and turnaround time of each processor under the following scheduling algorithms by completing the provided table: 1) First-Come-First-Serve (FCFS) 2) Preemptive Shortest-Job-First (SJF) 3) Round-Robin (RR) with time quantum = 1 and round order ABCD. (We assume that if a process arrives exactly when its round starts, this process can start execution immediately.) (b) Is it possible to schedule these four processes so that they all meet their deadlines? If yes, please explain how to schedule them. If not, please explain why