1. Consider the following set of processes, with the length of the CPU burst given in milliseconds: Processes Burst Timein ms) P1 5 P2 10 P3 7 P4 8 Table 1: Process table The processes are assumed to have arrived in the order P1, P2, P3, P4, all at time 0. a) Draw a timeline for each of the following scheduling algorithms: (2*3 = 6 Marks) i) FCFS ii) SJF iii) Round Robin (use time quantum of 4, ignore context switching and natural wait) b) Calculate the turnaround time of each process for each of the scheduling algorithms in part (a)? (3 Marks) c) Calculate the waiting time of each process for each of the scheduling algorithms in part (a)