Sample output of the Banker’s Algorithm: – Enter claim graph – Request resource – Release resource – Determine safe sequence – Quit program Enter selection: 1 Enter number of resources: 3 Enter number of units for resources (r0 to r2): 1057 Enter number of processes: 5 Enter maximum number of units process p0 will claim from each resource (r0 to r2): 753 Enter maximum number of units process p1 will claim from each resource (r0 to r2): 322 Enter maximum number of units process p2 will claim from