Calculate the Search Cost of this Binary Search Tree and  determine whether it is an Optimal Binary Search Tree. If it is not  optimal, please draw the Optimal Binary  Search Tree and the Smallest Expected Search Cost.

1. Based on the  previous question, is the Optimal Binary Search Tree you found in 1.  unique? If not, please draw  two different  Optimal Binary Search Trees with the same Smallest Expected Search Cost  to demonstrate.

 

do K1 d K2 d K3 d3 k4 i0 1 2 3 4 5 Pi 0.05 0.15 0.15 0.10 0.10 qi 0.05 0.10 0.05 0.10 0.05 0.10 d4 K5 d5