Could use some help on this question!

Question 3 [Points 6] Implement Banker's algorithm for a two resource system. For the given input, show whether or not the system is in safe state by showing the order in which process can finish or not finish. You are given the available copies of R1 and R2 as well as the information for each input process (maximum resources needed of each type). Run the system for the following input: 56 (\#of copies of R1 and R2) 4 (\#of input processes) 13 (Max need of P1 for R1 and R2, respectively) 53 (Max need of P1 for R1 and R2, respectively) 43 (Max need of P2 for R1 and R2, respectively) 44 (Max need of P3 for R1 and R2, respectively) Requests to fulfill are: Process P1 needs 1 of R1 and 1 of R 2 Process P2 needs 1 of R1 and 3 of R2 Process P3 needs 1 of R1 and 2 of R2 Show the order in which these requests will be fulfilled and all process finish execution