a) Consider the following snapshot of a system Allocation Max Available Process ABC ABCABC 4 1 5 3 10 11 Pl 13 P2 111 3 5 4 21 42 2 5 P3 P4 1 3 22 04 2 5 5 3 2 1 3 4 i) What is the content of the matrix Need? [1.5 marks] ii) What is the total resources (A, B, C) in this PC? [1 mark] iii) Give the sequence of execution that will not result in any deadlock. Show the number of resources available (A,B,C = ?,?,?) after the completion each process. [5 marks] iv) If a higher priority request made by process P3 for (3, 3, 3) resources, can the request be granted immediately? [1.5 marks] v) Based on the Resource-Allocation Graph below, draw the Wait-for Graph [1 mark] R Rs P2 Ps P R2