help with these questions on deadlocking?

We consider 5 processes, P1, P2, P3, P4, and Ps that must share 4 resources R., R., Re, and Rd. The table below gives the total number of instances of each resource: R. 12 Rb 13 Rc 13 Rd 10 The following table gives the current number of instances of each resource held by each process R. R Rc Rd P1 1 3 2 1 4 2 3 3 2 1 5 2. N P2 P3 PA Ps 2 3 0 3 0 0 3 1 2 The last table gives the maximum number of instances of each resource that each process needds to hold in order to complete its execution. Ra Rb Rc Rd 5 7 on on ? 4 7 8 00 5 P1 P2 P3 P4 4 4 7 5 4 5 5 4 Ps 1 4 3 3 10 pts Question 1 Draw the resource allocation graph for R and the 4 processes involved. Question 2 20 pts Use the banker's algorithm to answer the following question: Is the current state safe or unsafe? Question 3 10 pts Process Parquests two instances of Rc. Should the request be granted? Justify your answer. Question 2 20 pts Process P2 rquests two instances of Rs and two instances of Rc. Should the request be granted? Justify your