Question $43(0\mathrm{.}5$ points$)$

Job A and B arrive at time $0$ and Job C arrives at time $50.$ The runtimes for Job A$,$ B$,$ and $C$ are $100,10,$ and $50,$ respectively. Some jobs may request $\frac{\text{I}}{O},$ as well. Which of the following rules will be enforced in Multi$-$Level Feedback Queue $($MLFQ$)$ CPU scheduling strategy with priority?

If Priority $(A)=$Priority$(B),A$&$B$ run in round$-$robin fashion using the time slice $($quantum length$)$ of the given queue

When a job enters the system, it is placed at the highest priority $($the topmost queue$).$

If Priority $(A)>$Priorim $($ B