How can i draw a general resource graph which cannot be completely reduced but which is free from deadlock? How can i draw a general resource graph which cannot be completely reduced but which is free from deadlock?

A general resource graph which can be completely reduced and hence is free from deadlock is shown below.



As depicted above, R1 and R2 are resources and P1 and P2 are processes.
A general resource graph which cannot be completely reduced but which is free from deadlock is illustrated below.

R1 and R2 are reusable resources, and P1 and P2 processes.