$10.$ Consider the following processes $($timing is in seconds$)$:

P$1$: Runs A$,$ I$/$O on HD$1(2),$ Runs $4,$ I$/$O on HD$1(5),$ Runs $1,$ Ends.

P$2$: Runs $2,$ I$/$O on HD$2($B$),$ Runs $1,$ I$/$O on HD$2(7),$ Runs $3,$ Ends.

P$3$: Runs $3,$ I$/$O on USB $(2),$ Runs C$,$ I$/$O on USB $(4),$ Runs $10,$ Ends.

Where A$,$ B$,$ and C are your student ID numbers as follows: $10$xABCxxx

As you can see, the I$/$O is done on different devices for each of the processes $($thus$,$ you do not

worry about contention for the devices; whenever a process requests to do an I$/$O$,$ the device will

be free and available to start$).$

a$)$ Create a Gantt Diagram considering the execution time for each of the processes using the

SJF algorithm. The priority of process Pi is computed as Ti$=($Ti$+$t$)/2($where t is the time of the

last CPU burst$).$ Initially, the priority is $0$ for every process.