help with these questions on deadlock

30 pts Problem 1 We consider a resource R that has 11 instances, to be shared by 4 processes, P, P2, P3, and P4. We start looking at the system at a time where these processes hold 3 instances of R. 2 instances of R, 2 instances of R, and I instance of respectively. We know that the maximum numbers of instances of that these processes need to hold are 6 for P., 8 for P2, 2 for P3, and 4 for P4. 10 pts Question 1 Draw the resource allocation graph for R and the 4 processes involved. 10 pts Question 2 Use the banker's algorithm to determine whether the current state is safe or unsafe. 5 pts Question 3 Process P1 requests one instance or R. Shouldd the request be granted? Justify. 5 pts Question 4 Process P2 rquests one instance or R. Shouldd the request be granted? Justify