1. Use a greedy Heuristic to determine the best number of coins to give back for A=12, and denominations of {1, 3, 10} 2. Show the resulting matrix when using Dynamic Programming on the previous problem. 3. Given the following prices: length(i) 1 2 3 4 5 6 price p 2 3 7 9 11 13 Use the rod cutting algorithm to determine the r and s arrays Find the maximum revenue and the places to cut for a rod of length 4 Find the maximum revenue and the places to cut for a rod of length 5 Find the maximum revenue and the places to cut for a rod of length 6 4. What is the runtime complexity of the rod cutting algorithm? Use the pseudocode to help you determine this. 5. Find the matrix c computed by the dynamic programming algorithm for the longest common subsequence problem when a = VAMPIRE and b = ZOMBIE. What is the longest common subsequence?