(Solved): 1. Show how the deadlock detection algorithm works on the resource graph in Figure la (previous pag ...

1. Show how the deadlock detection algorithm works on the resource graph in Figure la (previous page) to find all potential deadlocks. Please show your work, and identify the processes and resources involved ( 8 pts). 2. A system has four resources and five processes. The resources in existence vector is \( \mathrm{E} \) \( =(224 \) 4 ). The current allocation (C matrix) and requests ( \( R \) matrix) are shown in Figure \( 1 \mathrm{~b} \) (previous page). What is the resources available vector A? Can you detect any deadlock? Please show your work (12 pts). (a) Chapter 6, Question 1. (b) Chapter 6, Question 2.