Given the following state for the Banker's Algorithm . 6 processes PO through P5 . 4 resource types o A (15 instances) O B (6 instances) o C (9 instances) o D (10 instances) The current allocation of resources to processes as wel1 as the maximum resource demand of each process is shown below: Current Allocation Maximum Demand Process ABC D ABC D PO P1 P2 P3 P4 P5 1 9 555 0 1 1 12 2 33 4 1 0275 44 1 0 0 13 3 32 1 1 0 05 2 21 1 0 144 44 A. Calculate the available vector corresponding to this state. B. Calculate the need vector corresponding to this state C. Show that the current state is safe, that is, show a safe sequence of processes. In addition, to the sequence show how the available vector changes as each process terminates D. Suppose P5 makes a simultaneous request for 3 instances of resource A, 2 instances of resource B, 3 instances of resource C, and 3 instances of resource D. Should this request be granted? Why or why not