(a) Draw the 2-3 tree that results when you insert the keys S E A R C H X M P L ?n that order into an initially empty tree. Construct the corresponding red-black tree. I. (b) Find a sequence of keys to insert into a BST and a red-back BST such that the height of the BST is less than the height of the red-black BST, or prove that no such sequence is possible. (a) Draw the 2-3 tree that results when you insert the keys S E A R C H X M P L ?n that order into an initially empty tree. Construct the corresponding red-black tree. I. (b) Find a sequence of keys to insert into a BST and a red-back BST such that the height of the BST is less than the height of the red-black BST, or prove that no such sequence is possible