for an algorithm design an analysis class. I dont need the code to solve it but rather the step by step process. Thank you =)

Apply the dynamic programming algorithm to find all the solutions to the change-making problem for the denominations 1, 3, 5 and the amount n = 9. (Suggestion: Construct a program of the Algorithm ChangeMaking(D[1..3] = {1, 3, 5}, n =9). (Suggestion: Construct a program of the Algorithm ChangeMaking(D[1..3] = {1, 3, 5}, n =9).