QUESTION 2 (10 MARKS) Use Deterministic Modelling to analyse 4 process scheduling algorithms. Based on a set of processes with the length of the CPU burst given in milliseconds and corresponding priority shown below: Table 1 PROCESS BURST TIME PRIORITY P1 20 2 P2 4 4 P3 2 1 P4 1 3 P5 10 5 The processes are assumed to have arrived in the order P1, P2, P3, P4 and P5, all at time 0. a. Demonstrate the execution of these processes in the form of Gantt Chart using the following scheduling algorithms and calculate the average waiting time. i. First-Come-First-Serve (FCFS), (2 Marks) ii. Shortest-Job-First (SJF), (2 Marks) iii. Non-preemptive priority (a smaller priority number implies a higher priority, so priority = 1 will be first), (2 Marks) iv. Round-Robin (RR) with Time quantum =3 b. Based on your analysis, which of the algorithms results in the minimum average waiting time? (2 Marks) (2 Marks)