We stress again the difference between the complexity of a problem and
the complexity of an algorithm. In particular, we initially showed an O(Md)
algorithm to solve the Change problem, and there did not appear to be any
easy way to remedy this situation. Yet the DPCHANGE algorithm provides
a simple O(Md) solution. Conversely, a minor modification of the Change
problemrenders the problemvery difficult. Suppose you had a limited number
of each denomination and needed to changeM cents using no more than
the provided supply of each coin. Since you have fewer possible choices in