2) Four different types of resources (A, B, C, D) are shared by five processes. The total number of resources that the processes can request during their entire operation and the resources they hold at a certain moment of their execution are given below. CURRENTLY ALLOCATED MAXIMUM NEED AVAILABLE Proses P1 Proses ABCD P1 0 0 1 2 P2 2000 P3 0 0 3 4 P4 23 5 4 PS 0 3 3 2 A BCD 0 0 3 2 2 75 0 6 5 6 ABCD 2 1 2 0 6 P3 P4 P5 0 6 5 2 i) Calculate the remaining request matrix ii) Calculate the number of resources available at the beginning. ABCD ABCD Proses P1 P2 P3 P4 P5 ii) Is this state of the system safe? If it is safe, give a sample resource assignment sequence that will allow all processes to terminate. iv) When the system is in the above state, if process P1 requests for ((A, B, C, D):(0,4,2,0)) resources, what will be the response of the Banker Algorithm? If your answer is positive, provide a sample resource assignment sequence that will allow all processes to end