Hands$-$on assignment $2-2$: Revisit minimum number of US

postage stamps

Problem definition: To send the letter to my friend, Nate, it costs $140$ cents. We

have nine postage stamps and each costs, $1,10,21,34,70,100,350,1225,1500$

cents.

Step$1$: Implement your solution with dynamic programming to

compute minimum count of postage stamps needed to send the post

Step$2$: Analyze and report the worst$-$case time and space complexities of

your implementation

Compute by counting basic operations $($Don$\text{'}$t need to use recurrence relations$)$

Step$3$: Show that your implementation does provide an optimal solution

and discuss what makes the difference comparing to the solution with

greedy algorithm which we explored for hands$-$on assignment $1-2$ THEFUT