I$/$O Burst time needed. If a process never needs I$/$O$,$ then the I$/$O Burst for that process

would be $0.$ For ease of implementation, the following approach is suggested:

$1.$ All processes go into the Ready Queue at their arrival time.

$2.$ Processes that have a non$-$zero IO Burst time, upon entering the running queue

for the first time, will be placed into the Blocked queue after $50\%$ of their FIRST

CPU time quantum has been used. This will simulate a process doing some work,

then needing to do I$/$O so it is blocked.

$3.$ Upon completion of a process$$ I$/$O Burst time in the Blocked queue, it will be

moved back to the Ready queue. At this time, the process will continue to be

scheduled until it$$s CPU Bust is complete $($that is$,$ continue to get time quantums,

based upon its priority, until the remainder of its CPU Burst is exhausted$).$

$4.$ To simplify odd cases, it is highly suggested that processes with non$-$zero I$/$O

Burst time should have a CPU Burst time that is twice the time quantum.

$5.$ Provide output showing processes status. You may need to add additional

output to demonstrate your final product