Consider that five processes P0, P2, ..., P4 arrive for execution at the times indicated in Table 1. No more processes will arrive until the last process completes. All jobs are completely CPU bound. All times are given in seconds. The priority range is from 1(highest) to 5 (lowest). Table 1: Process arrival/CPU-burst times and priorities. Process Id Arrival Time PO 0 P1 2 P2 P3 P4 12 Note: The values of burst time and priorities are taken from your registration number i.e. if your registration number is 12345 then the Burst time/ Priority for process PO will be 1, for Pl it will be 2 and so on, if your registration number is of six digits i.e. 123456 then Burst time/ Priority for process POwill be 12, for Pl it will be 3 and so on, i. Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: [02 Marks] Preemptive and Non-Preemptive Shortest Job First; Preemptive and Non-Preemptive priority; ii. Determine the turnaround time of each process for each of these scheduling algorithms? [01 Marks] iii. Determine the waiting time of each process for each of these scheduling algorithms? [01 Marks] iv. Determine the response time of each process for each of these scheduling algorithms? [01 5 8