Algorithm question. Please explaing

The coin changing problem is a problem that can be solved using dynamic programming. The problem is given C types of coins and N amount of money to make change for, give the minimum amount of coins to make up N amount of money. Write pseudo code to solve this problem and analyze the run time of your solution. You must use either memoization or dynamic programming to solve it. Your code will be marked wrong if it runs in exponential time