15%) Assume that the probability of searching for each key is the same,
(a) Construct a 2-3 tree for the keys: N,E,W,Y,O,R,K,U,S,A (use the alphabetical order of the
letters and insert them successively) (5%)
(b) Compare the average performance of binary search tree and 2-3 tree for successful
searches via the case in (a). (10%)