QUESTION 2 (20 marks) a) A system comprises five processes [P1 P2 P3 P4 P5] and three resources [R1 R2 R3]. Snapshot at the initial time stage is shown in Fig. 2(a). 2 R1 R2 R3 R1 R2 R3 P WI 3 3 4 P 1 2 0 P2 2 3 3 P2 0 1 1 R1 R2 R3 P3 2 1 3 0 1 10 5 6 P4 2 1 2 P4 2 1 1 Resource vector R PS 2 3 0 Ps 2 0 0 Claim matrix C Allocation matrix A Fig. 2(a). Deadlock Prevention using Banker's Algorithm 2 ECIE 4314 Operating Systems i. Sketch resource allocation graph of the system. (3 marks) ii. Calculate the Available Vector (V) and Need Matrix (Q). (2 marks) iii. Use banker's algorithm to predict whether the current allocation state is safe. If so, give at least one safe sequence of the process. Besides, show how the Available Vector (V) changes as each process terminates