Consider that there are Four process named as P1, P2, P3 and P4 with the six different resources R1, R2, R3, R4, R5 and R6. R1, R2, R3 has only one instance, R4 has three instances, R5 has two instance and R6 has three instances. Process P1 is holding the resources R1, R4, R5 and requesting the resource R2. Process P2 is holding the resources R5 and requesting the resource R2. Process P3 is holding the resources R2, R3 and requesting the resource R5. Process P4 is holding the resource R6 and requesting the resource R3. Draw the resource allocation algorithm based on the given instruction and identify whether a deadlock case is existing or not.