Problem 1: Optimal Binary Search Trees [15 pts Consider the following input to the Optimal Binary Search Tree problem (it is presented in the same format as the example powerpoint file posted on the lecture page) i12345 678 f(a) 5718462 3 a) Fill in the two tables below. As in the example powerpoint only the entries with i < j need to be filled in. We have started you off by filling in the [i, i]
OR
OR