Determine the cost and structure of an optimal binary search tree for the keys i = 1, 2, 3, 4 with probabilities pi given in the following table. Draw tables showing the values of e and root, as is done in Figure 15.10, or as in the slides. Note that we are assuming all the qi are zero. Table for e[i, j] Table for r[i, j]