5. Calculation 1. (15) Consider the following set of processes, with the length of CPU burst given in the table. The processes are assumed to have arrived in the order P1, P2, P3, P4 at time 0. Draw the Gantt chart that illustrates the execution of these processes using the following scheduling algorithms and calculate the average waiting time. (1) First Come First Served (FCFS). (2) Shortest Job First (SJF). (3) Shortest-Remaining-Time-First (SRTF). (4) Round Robin (RR, quantum=2ms). Process P1 P2 P3 Arrive Time 0 1 3 Burst Time/ms 3 1 4 2.(10) A system has three types of resource: A, B, C, and D. At time TO, a snapshot of the system is as follows. The total number of A, B, C, and D is 10, 9, 12, and 10. Answer the questions using the bank's algorithm. Allocation Max Process R1 R2 R3 R4 R1 R2 R3 R4 P1 P2 2 0 2 0 3 3 2 0 2 1 1 3 1 4 6 4 2 2 3 0 4 5 2 7 3 2 2 5 1 694 P3 P4 (1) What is the number of available A, B and C? What is the content of the matrix Need? (2) Is system in safe state or not? If it is safe, show the safe sequence. If it is unsafe, describe the reason. (3) If a request from process P1 arrives for (0,1,1,0), to make sure that system is in safe state, can the resources be allocated for the process? If the resources can be allocated, show the safe sequence. If the resources cannot be allocated, describe the reason