Q9. [Deadlocks] In the code below, three processes are competing for six resources (A-F). a. Using a Resource Allocation Graph (RAG), show the possibility of any deadlock in tl implementation. b. Modify the order of some of the get requests to prevent the possibility of any deadlock. Y cannot move requests across procedures, only change the order inside each procedure. You c resource allocation graph to justify your answer. void PO () void P1 () void P2 () while (true) while (true) while (true) get (A) get (B) get (C)i // critical region: //use A' B' ? release (A) release (B) release (C) get (D) get (E) get (B) // critical region: //use D. ?. ? release (D) release (E) release (B) get (C) get (F) get (D); // critical region: use C, F, D release (C) release (F) release (D)