Question 3 30 Marks [Resource allocation graph- concurrency] In the code below, three processes are competing for six resources labelled A to F. void PO() void P1() Void P2() { while ( true) { while(true) { While(true ){ get (A); get(D); get(C); get (B); get(E); get(F); get (C); get(B); get(D); //critical region //critical region //critical region //use A,B,C // use D, E, B // use D, E, B release(A); release (D); release (C); release(B); release (E); release (F); release(C); release (B); release (D); Source: Stallings, W (Year), Operating Systems Internals and design Principles, Pearson 3.1 Using a resource allocation graph, show the possibility of a deadlock in this implementation (10 marks) 3.2 Modify the order of some of the get requests to prevent the possibility of any deadlock. (10 Marks) 3.3 Is it possible that a resource deadlock involves multiple units of one type and a single unit of another? If so, give an example. (10 marks)