The pseudo code for the Greedy version for the Banker$$s algorithm can be found in this module$$s

Commentary. We know that this algorithm only finds ONE solution $($safe sequence of processes$)$

assuming there is one; otherwise reports there is no solution.