Show all the states clearly. process Allocation MaxABCABC32256201 0111323211POP1PzP3P4210561996-321BrouAvaliableABC200•Allocation and max will tell how much.resources each process need.process• Once completedMax will add into the avaliasse.for that process, all the1. Write the safe sequence of process, if it is safe?2. If any which process are able to finish and what resources are availablebefore it become unsafe, if it is unsafe?

Explanation: A resource allocation that is used to avoid deadlock is called Banker’s algorithm. To…

process Allocation max ABC 562 Be PO P1 Pz P3 P4 ABC 322 01 0 111 323 211 210 561 996 324 Avaliable ABC. 200 •Allocation and max will tell how much. resources each process need. process • Once completed for that process, all the Max will add into the avaliasse. 1. Write the safe sequence of process, if it is safe 1 2. If any which process are able to finish and what resources are availabl before it become unsafe, if it is unsafe?