Given the following processes, their arrival time and next CPU burst time, develop CPU schedule for each of the following scheduling algorithms and answer related questions: Process P1 P2 P3 P4 Arrival Time 0 0 1 2 SJF (non-preemptive) 1. Show execution schedule (Gant chart is preferred) 2. Waiting time for P1, P2, P3 and P4 3. Turnaround time for P1, P2, P3 and P4 Shortest-remaining time first (preemptive) 4. Show scheduling order (Gant chart is preferred) 5. Waiting time for P1, P2, P3 and P4 6. Turnaround time for P1, P2, P3 and P4 7. Number of voluntary context switches 8. Number of non-voluntary context switches CPU Burst Time 8 3 1 3