2. Consider the following sequence of resource requests andreleases:
P1 requests R3
P2 requests R1
P2 requests R2
P1 requests R1
P2 releases R1
P2 releases R2
A). Draw a resource allocation graph for each step. Does thissequence lead to deadlock?
B). Suppose that P1 requested R2 instead of requesting R1 instep 4. Would this lead to deadlock? Suppose it requested both R1and R2? Explain.
Expert Answer
An answer will be send to you shortly. . . . .