3. [10pts] Given the keys k1,k2,k3,k4,k5 sorted in ascending order alphabetically, with respective search frequencies of 0.30,0.04,0.01,0.45,0.20, construct the optimum binary search tree and write down its cost