Suppose that we have a set of coin denominations ci, c2, c algorith algorithm to optimally give X cents as change. . c, where the greedy coin changing m does not always produce the optimal solution. Describe a dynamic programming a. Make use of a 1 dimensional table with X elements. What is the meaning of the jh cell in the table? b. Write a recursive mathematical function to compute the jth entry. c. How long would it take to compute