$//$ PLEASE DRAW THE REQUIRED STEPS $//$ NO CODE PLEASE$//$ Consider the coin denomination array $($CD$)$ and the sum of the coin values $($S$)$ given below. Use the dynamic programming algorithm discussed in class to determine the minimum number of coins and the actual coin values that one would pick up so that the sum of the coin values is S$.$

Show the contents of the MNC and LCP arrays for each iteration, as discussed in the slides. Discuss how you would trace the solution to determine the actual coin values that need to be picked up for the given S$.$

Assume an infinite supply of coins for each value. Break any tie in favor of the coin with a lower index in the CD array.

Also, use the greedy approach to determine the number of coins that would be needed and the actual values of the coins that one would pick up$?$

Coin Denomination $($CD$)=1345$ Array Sum of the Coin Values $($S$)=12$