Deadlock Avoidance.

$($a$)$ Show that the request $Re{q}_0$ on the left side can be granted with respect to the resource allocation state with deadlock avoidance. Give a possible safe sequence after the pretended allocation and indicate the number of possible safe sequences.

$($b$)$ After the request by $P_0$ is satisfied, another process $P_x$ apologizes that it makes a mistake in underreporting its maximum need in one of the resource types by one. Due to noise in the network communication, only the last two bits of the identity of $x$ is correctly received by the operating system, and the type of the resource under$-$reported is corrupted. However, the operating system can still mange to conclude that the corrected resource allocation state upon adjusting for this under$-$reporting remains safe. Determine the possible identities of $x.$ Explain how you arrive at your answer.

$($c$)$ After a while, $P_x$ comes back and reports to the operating system that its original report on maximum need was correct and that the mistake of under$-$reporting is a false alarm. Back comes another distinct process $)(x$ apologizing that it under$-$reports its maximum need in one of the resource types $Y$ by one. Knowing $Y,$ the operating system is happy to conclude that the corrected resource allocation state upon adjusting for this under$-$reporting remains safe. Determine the possible identities of $Y.$ Explain how you arrive at your answer.

$\backslash$table$[[$Q$3,$Allocation,Max