Q5. Table below describe the snapshot of the system taken at particular time. Using banker's algorithm, determine if the system is in a safe state. (Note: Assume that the available resources for A, B and C are 4, 3, 2 respectively) Processes Allocation Maximum A B C A B C P1 0 1 1 6 6 1 P2 3 1 4 2 2 P3 3 O 1 5 3 3 P4 O 1 1 1 4 NO P5 5 5 P6 2 2 3 4 2 Q6. In some operating systems, process scheduling may be performed at 3 different levels, namely short-term, medium-term, and long-term scheduling. For short-term scheduling, some commonly used CPU scheduling policies are First-Come- First-Served (FCFS), Shortest-Remaining-Time-First (SRTF), Round-Robin and Preemptive Priority -based scheduling