Question $3.$ Processor Scheduling $(40$ pts$.)$

PART A$.$ Consider the following set of processes:

$\backslash$table$[[$Process Name,Arrival Time,Service Time$],[$A$,0,12],[$B$,1,4],[$C$,3,8],[$D$,4,2],[$E$,8,4]]$

Five processes $($A through $E)$ arrive to system with one processor at arrival times shown in the above table. Draw a timing chart illustrating the execution of these processes. Compute finish time, turnaround time, and normalized turnaround time of each for the Shortest Remaining Time $($SRT$)$ preemptive scheduling algorithms. Also calculate the mean turnaround and mean normalized turnaround times. $($In your calculations Ignore context switching time ${?}^1),$ use only two digits after the dot. i$.$e$.2\mathrm{.}13672\mathrm{.}14)$

$\backslash$table$[[$Process$,$Arrival Time,$\backslash$table$[[$Service Time$],[(T_s)$