distribution Parity

vi$.$Consider the following set of jobs to be scheduled on a single CPU system, draw a Gantt chart showing $[3$ Marks$]$

a$)$ First Come First Serve Scheduling Algorithm

b$)$ Shortest Job First Scheduling Algorithm

$\backslash$table$[[($v$\_(1))/($s$\_(2)),\backslash$table$[[$Arrival Time$],[0]],$Size $($msec$),$Priority$],[$N$\_(3),(2)/(3),(8)/(10),$Gold$],[4,(3)/(7),(10)/(5),$Silver$],[,11,(5)/(3),$Gold$],[,,2,$Bronze$],[,,4,$Silver$],[,,,$Bronze$]]$