Question 2. Consider the following snapshot of a system (P-Process, R-Resource): Available Maximum Demand Current Allocation 0 0 0 0 0 Answer the following questions using banker's algorithm a) [5 points] Calculate the Needs matrix: Needs b) [10 points] Is the system in a safe state? If so, show how you derive a safe order with Safety Algorithm in which the processes can run. Show the different values of the work vector after each iteration. What is the sequence of processes that the algorithm implicitly created? Ifa request from process Po arrives for (0, 3, 0, 0), can the request be granted immediately? Justify your answer, using only the knowledge of the sequence you found at sub-question (b) c)