Code in C++

E. Banker's Algorithm for the purpose of deadlock avoidance Deadlock is a situation where in two or more competing actions are waiting for the ofler to fitmili, atd thus neither ever does. When a new process enters a system, it must declare the maxirnum funnibs of. instances of each resource type it needed. This riumber may exceed the fotal number of rescuitees in the system. When the user requests a set of resources, the systern must determine whether the alliontion of each resource will leave the system in safe state, If it will the resources are allosation, ollor wise, lhes process must wait until some other process release the rescurces. Sample Output Enter the no. of processes and resources: 43 Enter the claim matrix: 363421122342 Enter the allocation matrix: 100 612 211 002 Resource vector: 936 All the resources can be allocated to Process 2 A vailable resources are: 623 Process 2 executed?:y All the resources can be allocated to Process 3 Available resources are: 834 Process 3 executed?:y All the resources can be allocated to Process 4 Available resources are: 836 Process 4 executed?:y All the resources can be allocated to Process 1 Available resources are: 936 Process 1 executed?:y System is in safe mode The given state is safe state