Need help with number 1

o) student Home-myFSUV-My Blackboard ContentyOHw3 cop 4531 pdf C | www.cs.fsu.edu/~tvhoang/classes/Hw3_cop453 1.pdf xG chegg Study Guided S Apps New Tab Online Derivative Ca M ITSDocs: Create, Cop In Unik, how do I list db vi/vim notesIn Unix, how do I cha C-String Password-Introduction to OOP Implementing Sieve Hw3 cop4531.pdf 1. [U (15 points) Consider the Coin Changing Problem, but now you have to give change in quartens (25 cents), shillings (12 nts), and pennies (1 cent) a) Show that the greedy algorithm fails to work, by giving a counter-exanple b) Give a bottom-up dynamic-programming algorithm DColns(n) to solve the Coin Changing problem (using quarters, shillings, and pennles). Your algorithm only needs to return the optimal number of colns, not the actual optimal way to give change. Wlhat's the running time of your algorithm (in e-notation)? 2 20 points) Consider the Conn Changing Problem, but now your arrency denomination is 1, 2, 22 3. (20 points) Exercise 20, page 329-330, Chapter 6 of the textbook 4. [G (15 points) Exercise 17 in page 197, Chapter 4 of the textbook. instead of1, 10,25). Show that the greedy algorithm works for this type of denomination 10/11/2017