Please solve this question!

34. Use a greedy approach to construct an optimal binary search tree by con- sidering the most probable key, Keyk, for the root, and constructing the left and right subtrees for Keyi, Key2, ..., Keyk-i and Keykt, Keyk+2 , Keyn recursively in the same way. time complexity of this approach? Justify your answer. always find an optimal binary search tree. (a) Assuming the keys are already sorted, what is the worst-case (b) Use an example to show that this greedy approach does not