For the following four resource graphs, determine by graph reduction if a deadlock is present. An edge with an integer as label represents the number of resource units requested. [You need not show each step. If a deadlock is not present simply state so. If a deadlock is present, show the final stage of the reduction.]

a)

b)

c)

d)

P, P, P, R