1. Find at least two new coin denominations that make the greedy algorithm for coin changing shown in the chapter produce suboptimal results.
2. Using a "commercial" compression program, such as WinZip, compress a small text file. Then compress the same text file using a Huffman code program. Compare the results of the two compression techniques.
3. Using the code from the "carpet thief" example, change the items being stolen to televisions. Can you fill up the knapsack completely? Make changes to the example program to answer the question.