Consider five threads: TO, T1, T2, T3, T4; and three resource types: A, B, C. Here, A has 12 instances, B has 8 instances, and C has 9 instances. The current state of the system is presented on Table 1, where 'Allocation' represents the number of instances for each resource type currently allocated to each thread, and 'Max' represents the maximum demand of each thread. Answer the following questions based on Banker's Algorithm: a. Is the system in a safe state now? b. If the system is in a safe state, what is the corresponding safe sequence? It would suffice to present one safe sequence in your answer. Note: You must show the steps how you found the safe sequence. Threads ΤΟ T1 T2 Allocation A, B, C 3, 1, 1 2, 1, 1 1, 2, 1 Max A, B, C 10, 1, 2 3, 4, 4 6, 4, 2