Q7. (15 points): Consider the following resource allocation graph. Do the following problems: (a) Convert it to the matrix representation (i.c., Allocation, request and Availablt). (b) Do a step-by-step execution of the deadlock detection algorithm. For each step. add and remove the directed edges, and redraw the resource allocation graph. (c) Is there a deadlock? If there is a deadlock, which processes are involved