2. Apply the deadlock detection algorithm as below to the following data and show the results. Available (2100) (2 0 0 1 00 1 0 Requeste| 1 0 1 01 Allocation =12 0 0 1 0 1 2 0 2 1 0 0 Deadlock Detection Algorithmm Mark each process that has a row in the Allocation matrix of all zeros. Initialize a temporary vector W to equal the Available vector. Find an index i such that process i is currently unmarked and ith row of Q is less than or equal to W. That is, Q SW, for 1s ksm. If no such row is found, terminate the algorithm. If such a row is found, mark process i and add the corres ponding row of the allo- cation matrix to W. That is, set W a. b. c. d. WA, for 1s ksm. Return to step 3)