Consider the following snapshot of a system at time TO: Allocated resource A B C D 3 3 2 Max resource Available resource A B C D A B C D 0 6 9 2 1 0 2 2. 4 3 5 6 6 7 5 6 P1 2 3 3 6 P2 0 1 3 4. P3 2 0 2 2 2 0 3 4 P4 2 0 0 0 2 7 5 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 (1, 0, 2, 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