Consider the following snapshot of a system at time TO: Allocated resource Max resource Available resource A B C D A D A B C D IPO o o 2 O 1 3 2 2 1 2 0 P1 2 3 3 6 4 3 5 6 P20 0 3 4 6 6 5 6 3 3 2 6 9 2 P4 2 0 0 0 2 7 5 0 0 3 0 Answer the following questions using Banker's algorithm: Q1: Determine if the system is in a safe state or not. If it is safe, show the possible sequence of process execution; if not, please explain why. Q2: If process P2 requests additional resources (0, 1, 1, 0) at this time To, can the request be granted immediately? If yes, then show the sequence of successful process executions; if no, then explain why