1. Exercise 8.1 Question 1 (page 281): Comparing Dynamic Programming with Divide and Conquer
2. Exercise 8.1 Question 9 (page 282): Shortest Path counting
3. Exercise 8.2 Question 1 (page 292): Warshall's Algorithm example
4. Exercise 8.2 Question 7 (page 293): Floyd's Algorithm example
5. Exercise 8.2 Question 10 (page 293): Enhanced Floyd's Algorithm
6. Exercise 8.4 Question 2 (page 303): Knapsack Dyn Programming Algorithm
7. Exercise 8.4 Question 3 (page 303): Knapsack Dyn Programming Efficiency
8. Exercise 9.1 Question 1 (page 313): Greedy Failure
9. Exercise 9.1 Question 7 (page 314): Prim Examples
10. Exercise 9.2 Question 1 (page 322): Kruskal's example
11. Exercise 9.2 Question 6 (page 322): Kruskal's pseudo code