Problem 2: Dynamic programming approach to calculating the value function

Based on your work for the previous problem, write pseudocode for a dynamic programming algorithm that calculates the value function $C(n+1, \text{blank})$. Describe in words the order in which your algorithm processes the nodes of the word hypotheses graph.