A. Consider the following set of processes, with the length of burst times given in milliseconds. Suppose the following processes arrive for execution at the arrival times indicated.

Processes:

• P1: Arrival Time 0, Burst Time 20
• P2: Arrival Time 0, Burst Time 19
• P3: Arrival Time 1, Burst Time 20
• P4: Arrival Time 1, Burst Time 17
• P5: Arrival Time 6, Burst Time 9

i ) Draw a Gantt chart illustrating the execution of these processes using the following scheduling algorithms: SRTF (i.e., Preemptive SJF). Use the following table when answering