good handwriting or electronically typing please

Problem 1 [50 points] Design a dynamic programming algorithm for the change-making problem given an amount n and unlimited quantities ofeach of the denominations di, d2, ..., dm find the smallest number of coins that add up to n or indicate that the problem does not have a solution Analyze the running time of your algorithm. Try to make the running time of your algorithm as best as possible