There are $3$ processes entering a que to get processed, $P1$ enters at $T+0,P2$ enters at $T+20$ and $P3$ enters

at $P+30.$ Context switching time $(T_c)$ is $10,$ and the Time Quantum $(T_q)$ for preemptive schedules is $50.$

P$1$ requires $250$ to process

P$2$ requires $100$ to process

P$3$ requires $450$ to process

No Context Switch at the beginning, but there is for each swap of processes afterwards whether process

ends or is preempted.

What is the total time for processing all processes using FIFO schedule?

Is FIFO good for interactive type OS$?$ Why or why not?

What is the total time for processing all processes using RR$?$

What type of OS would RR be good for and why?

myFile is available on BB for use with this section of the assignment.