Hello i need answer for this question with graph please

Question 8 (2.1: /1.5 mark) Design a Resource Allocation Graph for the system with the following information about resources in a system: - There are four classes of resource labeled R1, R2, R3 and R4. - There are one instance of resources R3 and R4, and 2 instances of resources R1 and R2. - There are four processes labeled P1, P2, P3 and P4. - There are some resources already allocated to processes, as follows: - One instance of R1 held by P1 - One instance of R1 held by P2 - R3 is held by P4 - R4 is held by P3 - Some processes have requested additional resources, as follows: - P1 wants one instance of R2 - P2 wants one instance of R2 - P3 wants one instance of R2, and one instance of R3 - P4 wants one instance of R4 After you draw the graph, find out whether there is a deadlock or not. If there is a deadlock, write which processes case it. If not, write the allocation sequence