Please answer correctly....I have already received completely bogus answers.

Find the cost and the structure of an optimal binary search tree for a set of 7 keys with the following probabilities: p[..] = {0.16, 0.12, 0.14, 0.07, 0.15, 0.17, 0.19}. Use the algorithm from the class. BST(p, n)//Input: array p of n probabilities//Output: array c and root 1 for i = 1 to n + 1 2 c[i, i - 1] = 0//empty tree 3 for d = 0 to n - 1//d is the difference j - i 4 for i = 1 to n - d 5 j = i = d 6 c[i, j] = infinity 7 sum = 0 8 for r = i to j 9 sum+ = p_r 10 x = c[i, r - 1] + c[r + 1, j] 11 if c[i, j] > then c[i, j] = x and root[i, j] = r 12 c[i, j] + = sum 13 return c[..] and root [..] c[i, j] = {0 if j = i - 1, min_ i lessthanorequalto r lessthanorequalto j {c[i, r - 1] + c[r + 1, j] + sigma_t = 1^j pt} if i lessthanorequalto j. Please with full explanation of steps. Partial work/incorrect answers will not receive positive Feedback. Find the cost and the structure of an optimal binary search tree for a set of 7 keys with the following probabilities: p[..] = {0.16, 0.12, 0.14, 0.07, 0.15, 0.17, 0.19}. Use the algorithm from the class. BST(p, n)//Input: array p of n probabilities//Output: array c and root 1 for i = 1 to n + 1 2 c[i, i - 1] = 0//empty tree 3 for d = 0 to n - 1//d is the difference j - i 4 for i = 1 to n - d 5 j = i = d 6 c[i, j] = infinity 7 sum = 0 8 for r = i to j 9 sum+ = p_r 10 x = c[i, r - 1] + c[r + 1, j] 11 if c[i, j] > then c[i, j] = x and root[i, j] = r 12 c[i, j] + = sum 13 return c[..] and root [..] c[i, j] = {0 if j = i - 1, min_ i lessthanorequalto r lessthanorequalto j {c[i, r - 1] + c[r + 1, j] + sigma_t = 1^j pt} if i lessthanorequalto j. Please with full explanation of steps. Partial work/incorrect answers will not receive positive Feedback