Solve this problem

Please solve as hurry as you Can

I will upvote you sir

thanks in advance

1. a) Consider the following snapshot of a system. [6+3] Available ABCDE 1 11 21 Allocation ABCDE TO 4 20 21 T1| 2| 1| 5 | 0 | 2 T2 3 22 11 T3 1 3 5 1 1 T4 013 13 Max ABCDE TO 4 4 2 2 1 T1| 3 | 1| 5 | 2| 2 T2 3 4 2 4 1 T3 2 3 531 T4 3 1 3 2 3 1 i) Using the banker's algorithm, determine whether or not the state is unsafe. If the state is safe, illustrate the order in which the processes may complete. Otherwise, illustrate why the state is unsafe. You must calculate the Need matrix. ii) If a request from process T1 arrives for (0,4,2,0,2), can the request be granted immediately? Explain with proper calculations. [3+1] b) Consider the following resource allocation graph. P P P R O P. P, i) Convert it to the matrix representation (i.e., Find matrix for Allocation, request, and Available). ii) Is there a deadlock? If there is a deadlock, which processes are involved? [1+1] c) What is the hold and wait condition for deadlock? Explain why violation of this condition is sufficient to prove that there is no deadlock among the set of processes even if mutual exclusion and no-preemption conditions are valid