What is the solution to the below question

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 q, in which i - 0, 1, 2, . . , n, be the probability that a missing search key can be situated between Key; and Key. Analyze your generalized algorithm and show the results using order notation