Consider the following processes, arrival time, and CPU processing requirements Arrival Time: Process P1 P2 P3 P4 Burst Time: 0 2 6 6 2 2 For each of the following scheduling algorithms, draw the Gantt chart illustrating the execution of processes running on the CPU and find the average response time. Response time is the amount of time required to get the result for a process after it arrived. For Round Robin, assume that an arriving thread run at the beginning of its arrival time. i rst Come First served (FCFS) ii) Round Robin (RR) with timeslice quantum 1 i) Preemptive Shortest Job First (SJF) or Shortest Remaining Time First