Q$3.$ Scheduling Algorithm Problem

$(5$ Marks$)$

Consider the following set of processes, with the length of the CPU burst given in milliseconds.

$\backslash$table$[[$Process$,$Burst Time,Priority$],[$P$1,$I$0,3],[$P$2,1,1],[$P$3,2,3],[$P$4,1,4],[$P$5,5,2]]$

a$)$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS$,$ SJF Non Preemptive, SJF Preemptive, Priority and Round$-$Robin $($quantum$=1).$

b$)$ What is the waiting time of each process for each of the scheduling algorithms in part a$?$

c$)$ Which of the algorithms produce results in the minimum average waiting time $($over all processes$)?$

Q$4.$ Banker Algorithms

$(5$ Marks $)$

Considering a system with five processes $P0$ through $P4$ and three resources types $A,B,C.$ Resource type A has $7$ instances, B has $10$ instances and type C has $5$ instances. Suppose at time $t_0$ following snapshot of the system has been taken:

$\backslash$table$[[$Process$,$Allocation,Max,Availablc$],[$A$,$B$,$C$,$A$,$B$,$C$,$A$,$B$,$C$,],[$P$(),0,0,1,3,7,5,2,3,3,],[$P$1,0,2,0,2,3,2,,,,],[$P$2,2,3,0,2,9,0,,,,],[$P$3,1,2,1,2,2,2,,,,],[$P$44,2,0,0,3,4,3,,,,]]$

i$)$ What will be the content of need matrix?

ii$)$ Is the system in safe state? If yes, then what is the safe sequenee?

I want the solutions to be in tables, without explanation.