Homework 4 – Banker’s algorithm
Implement the Banker's algorithm for deadlock avoidance, with a given set of N processesÂ
(N<10, processes are P1, P2, …, PN) and M resource types (M<10, resources are R1, R2, …, RM). Use Java or C/C++ for the implementation, with