Analysis Of Algorithms - Optimal Binary Search Tree

Generalize the Optimal Binary Search Tree algorithm (Algorithm 3.9) to the case in which the search key may not be in the tree. That is, you should let qi, in which i = 0, 1, 2, , n, be the probability that a missing search key can be situated between Keyi and Keyi+1. Analyze your generalized algorithm and show the results using order notation. Need the modified algorithm and the time complexity of the algorithm ( below is the actual algorithm 3.9. Need modified one)

void optsearchtree (int n const float p, float&minavg, index RII) index i, j, , diagonal; float An0nl for i1 i