(Solved): Consider the Deadlock Detection algorithm and the following system state: Select below an additiona ...

Consider the Deadlock Detection algorithm and the following system state: Select below an additional request (Process Resources...) that will not lead to a deadlock. \( \operatorname{Pr} \) Res 0101 \( \operatorname{Pr} \) Res \( \begin{array}{lllllllll}1 & 1 & 1 & 1\end{array} \) \( \operatorname{Pr} \) Res 1101 Consider the First-In-First-Out (FIFO) page replacement algorithm with 3 frames ( 3 pages can be in memory at a time per process) and the following string of memory references (reference string): \[ 33,89,34,13,66,89,13,38,62,66,99,66,99 \] What is the number of page hits?