] Consider the following set of processes with sequence of CPU and I/O bursts. A arrives at t=0 and B arrives at t=2. The length of the CPU burst time and I/O burst time are given in the parentheses:...

] Consider the following set of processes with sequence of CPU and I/O bursts. A arrives
at t=0 and B arrives at t=2. The length of the CPU burst time and I/O burst time are given in the
parentheses:
A: CPU burst (5) – I/O burst (2) – CPU burst (8)
B: CPU burst (2) – I/O burst (4) – CPU burst (2)
(a) [12 pt] Draw the Gantt charts that illustrate the execution of these processes using preemptive
SJF and round robin scheduling algorithms respectively (quantum =3)