(5min 3pts) 2) Process P1 P2 P3 Burst time 6 9 2 Use the Round Robin (RR) with time quantum= 4 Draw the Gantt Chart? How many switches? Eisa Abdulrazaq D. 18 min. 10 pts. 3) If you have 5 processes PO to P4: 3 resources types: A (10 instances), B (5 instances), and C (7 instances) Snapshot at time TO: Allocation Max Available ABC ABC ABC PO O 11 7.5 3 4 3 2 PL 101 3 2 2 P2 3 1 2 91 2 P3 OO 1 2 1 2 P4 2 0 0 4 3 3 Use Banker's algorithm to fine the followings: A. Find the needs B. Find the safety sequence? C. Can request for (3 3 2) by P2 be granted? If it does, find new available, allocation and need for P2? D. Can request for (113) by P1 be granted? If it does, find new available, allocation and need for P1? SHOW YOUR WORK