Simulate the Banker' s algorithm Suppose we have 3 resources, 5 processes For a given input of . resource total number (Total vector) current resource allocation state (Allocation matrix) maximization resource request (Max matrix) Determine whether deadlock will occur. If no deadlock, give a safe sequence of the processes. Implement in any programming language you prefer The report should include below parts: Design of your program Explanation to key algorithms of your program Sample usage of your program (screenshots or videos) You can use different test cases to test your program Analysis, conclusions and future work