Exercise 3: As money grows, the size of the array required by DPChange grows as well. Explain how this algorithm can be modified to still compute MinNumCoins(money, coins) while the array size required does not exceed the size of the largest coin denomination. 9 10 11 12 | money 7. 8 6. 4. 0. 32 2 3. 1. 2. MinNumCoins 3. coins = (1, 4, 5) 2020 Compeau and Pevzner Boinformatis Algorithms An Acthe Leaming Appoach 81 Change with Dynamic Programming DPChange(money, coins) minNumCoins array of length money + 1 for m e 1 to money minNumCoins[m] + for i + 1 to |coins| if m 2 coins[i] if minNumCoins[m-cons[i]] + 1