Suppose that the following processes arrive for execution at the times indicated.

Each process will run for the listed amount of time.

Process Arrival Time Service Time

P$104$

P$217$

P$343$

P$468$

a$.$ Do the following scheduling algorithms:

$1.$ Round Robin $($Q $=1)$

$2.$ Shortest Remaining Time

b$.$ For the algorithms draw the Gantt diagram.

Can you do a step by step explanation on drawing both diagram. Thank you