6. Calculation Questions (30) 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. 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). (3) (2) Shortest Job First (SJF). (4) (3) Shortest-Remaining-Time-First (SRTF). (4) (4) Round Robin (RR, quantum =3ms ). (4) 2.(15) A system has three types of resource: A, B, and C. At time T0, a snapshot of the system is as follows. The total number of A,B, and C is 8,11 , and 12. Answer the questions using the bank's algorithm. Calculation steps should be provided in detail. (1) What is the number of available A, B and C? (2) Write the matrix Need. (2) (2) Is this system in safe state or not? If it is safe, show the safe sequence. If it is unsafe, describe the reason. (6) (3) If a request from process P3 arrives for (1,0,0), to make sure that system is in safe state, can the resources be allocated for this process? If the resources can be allocated, show the safe sequence. If the resources cannot be allocated, describe the reason