Given the following set of processes, with the length of the CPU requirement time given in milliseconds: Process CPU requirement 4 Priority The processes are assumed to have arrived in the order A, B, C, all at time 0. Please answer the following questions (1) Draw four Gantt charts illustrating the execution of these processes using FCFS non-preemptive SJF, a non-preemptive priority (a larger priority number implies a higher priority) and RR (quantum 2) scheduling. (2) What is the turnaround time of each process for each of the scheduling algorithms in part (1)? (3) What is the waiting time of each process for each of the scheduling algorithms in part (1)