Try this exercise. Fill in the missing part by typing it in.

The dynamic programming solution for the coin change problem is more efficient than the recursive solution because it avoids ____ by storing intermediate results in a matrix.