CS 317-Banker's Algorithm Homework 1 Page Example 1 following is a system snapshot of four processes and three resources Max Allocation Available ABCABC A B C P 0 01 001 P1 175 10 0 P 2 3 5 135 P 0 6 5 0 63 Total 299 5 2 a) How many resources are there of type (A, B, C)? b) What is the contents of the Need matrix? A B C P. c) Is the system in a safe state? Why or why not? d) Ifa request from process Parrives for additional resources of (0,5,2), can the Banker's algorithm grant the request immediately