How would you construct an optimal binary search tree for a set of $$ keys if all the keys are equally likely to be searched for? What will be the average number of comparisons in a successful search in such a tree if $=2($ is an even number$)?$