(a) Consider the ready list containing the processes and their burst times as shown in the following Table-4. The processes are assumed to arrive at the same time. Processes Burst Time P1 6 P2 1 P3 2 P4 1 P5 5 PO 4 Table-4. Based on the above table, draw a timeline to turn it around and calculate the average turn-around and waiting times for the following scheduling algorithms. (i) Non Pre-Emptive, First Come, First Served: (ii) Shortest Job First scheduling methods: [6 Marks]