1. (9 points) Consider this set of processes. Construct Gantt charts for the scheduling algorithms indicated below and compute the individual and average waiting time, individual and average response time and individual and average turnaround time for each algorithm FCFS (non preemptive), SJF(non preemptive), and RR (TQ 3): Process Arrival time Burst time P1 P2 P3 1P1 P5 0 12 17 AVERAGE Provide Gantt charts and results for all three algorithms