Describe an algorithm to determine the number of ways to give change for N dollars with notes of values from a given set S. Analyze the running time of your algorithm. (Example: If N = 40 and S = {10,20,30}, there are four solutions: {10,10,10,10},{10,10,20},{20,20},{10,30}. So output should be 4.)