Problem $1(100$ points$)$

Consider the following set of processes:

$\backslash$table$[[$Process$,\backslash$table$[[$Arrival$],[$Time$]],\backslash$table$[[$Processing$],[$Time$]]],[$A$,0,3],[$B$,1,5],[$C$,3,2],[$D$,9,5],[$E$,12,5]]$

Perform the following scheduling policy analysis for the above set of processes like the fig. $9\mathrm{.}5$ or Table $9\mathrm{.}5($on the slide$/$book$).$

a$)$ FCFS

b$)$