(2) Exercise 15.5-2 (page 404). Your answer should include the tables for e[i,j], w[i,j] and r[i,j]. 15.5-2 Determine the cost and structure of an optimal binary search tree for a set of n = 7 keys with the following probabilities: il o 1 2 3 4 5 6 7 Pi 0 .04 0.06 0.08 0.02 0.10 0.12 0.14 qi 0.06 0.06 0.06 0.06 0.05 0.05 0.05 0.05 (2) Exercise 15.5-2 (page 404). Your answer should include the tables for e[i,j], w[i,j] and r[i,j]. 15.5-2 Determine the cost and structure of an optimal binary search tree for a set of n = 7 keys with the following probabilities: il o 1 2 3 4 5 6 7 Pi 0 .04 0.06 0.08 0.02 0.10 0.12 0.14 qi 0.06 0.06 0.06 0.06 0.05 0.05 0.05 0.05