3.3.1 please

Dinle Search Trees EXERCISES 3.3.1 Draw the 23 tree that results when you insert the keys E AS Y QUTION in that order into an initially empty tree. 3.3.2 Draw the 23 tree that results when you insert the keys Y L P M XHCRAES in that order into an initially empty tree. 3.3.3 Find an insertion order for the keys S EARCH X M that leads to a 23 tree of height 1. 3.3.4 Prove that the height of a 2-3 tree with n keys is between Llog, 0.63 lg n (for a tree that is all 3-nodes) and (ig nd (for a tree that is all 2-nodes). 3.3.5 The figure at righ The figure at right shows all the structurally different 2-3 trees with ys, for n from 1 up to 6 (ignore the order of the subtrees). Draw all the acturally different trees for n = 7,8,9, and 10. 3.3.6 Find the probabili result of the insertion of n random dis nd the probability that each of the 2-3 trees in EXERCISE 3.3.5 is the nsertion of n random distinct keys into an initially empty tree. one at the top of page 428 for the other five