Given a binary search trees for a set of n=5 keys with the following probabilities:i 0 1 2 3 4 5pi --- 0.15 0.10 0.05 0.10 0.20qi 0.05 0.10 0.05 0.05 0.05 0.10The expected optimal cost of the search is

• A. 2.65
• B. 2.70
• C. 2.75
• D. 2.80