Q8 Consider a system with four types of resources RI (3 units), R2 ( 2 units), R3 (3 units), and R4 (2 units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be completely satisfied. Three processes P1,P2 and P3 request the resources as in Table Q8 if executed t=2? request 1 i init of k4 t=6 i request a 1 unit of k1 t-e 2 Finiahes i unit of R3 frocesa par t0 i requeats 1 unit of R4 c-2 i requests 2 units of R t. t5; releases 2 units of Ri t=7 2 requests 1 unit or R2. t=8 : Fequests a wit of Ra t-9: Pini ahes If all three processes run concurrently starting at time c=0, (a) Draw the resource allocation graph at the time: (i) t8 (ii) t=9 (2) marks) (iii) t=10 (2 marks) (2 marks) (b) Determine whether deadlock occurs or not. If yes, which processes are in deadlock? (2 marks)