1. Explain what does the “exhibiting optimal substructure” mean? What it implies if a problem exhibits its optimal substructure?
2. Use your own words to explain when we can use greedy algorithm or dynamic programming to find the optimal solution? What is the difference in using the two?
