For the problem described in Ex. 15.9 about breaking a string a) Prove optimal substructure b) Write the recursive definition for defining the least cost solution c) Write the algorithm (either the memo-ized version or bottom-up version)
If you could help me get started on any of the above three questions (or all three), I would greatly appreciate it.