Operating Systems

Please read the questions carefully

and do not copy and paste from previous Chegg answers

thank you

Chapter 7-Banker's Algorithm - Safety algorithm - Solve the following questions using Banker's safety algorithm using the following system snapshot at time T0 (similar to slide 7.33) - Consider the following system snapshot at time T0: - Answer the following questions 1. What is the total number of instances of resource type C? 2. What is the number of allocated instances of resource type B? 3. The need of process P2 is: write it in the [abcd] format. 4. The Need Matrix is: 5. the system in a safe state at time T0 ? True / False 6. The following sequence is a safe state P1,P2,P3,P4,P5 True / False 7. Apply the safety algorithm and check if the system is in a safe state? Show all your work here including giving at least one safe sequence if it is in a safe state. other allocation and max are still same, is the system in a safe state? Show all your work again here including giving at least one safe sequence if it is in a safe state