Given a binary search trees for a set of n=5 keys with the following probabilities: i 0 1 2 3 4 5 $p_i$ - 0.15 0.10 0.5 0.10 0.20 $q_i$ ... The expected optimal cost of the search is 2.65 2.70 2.75 2.80