Problem I$-$ Uniprocessor Scheduling Polley $(40$ Pofites$)$

Consider the following set of processes:

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

Perform the HRRN scheduling policies analysis for the above set of processes. Draw the figmre plot in the provided grialines below.

Answer:

$0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20$

$$

Show calculations for FIRRN