Given a sequence of actions in a system below,

1 Proc e s s A holds R, wants S

2 Proc e s s B holds nothing , wants T

3 Proc e s s C holds nothing , wants S

4 Proc e s s D holds U, wants S and T

5 Proc e s s E holds T, wants V

6 Proc e s s F holds W, wants S

7 Proc e s s G holds V, wants U

Answer the following questions

(a) Draw the resource allocation graph for the above sequence of actions.

(b) Does the sequence lead to a deadlock? Why?