3. The sequence of keys 4,7,9,11,14,17,18,19,22 is obtained by an inorder traversal of binary search trees. (a) Please show out two different binary search trees which can produce the same sequence. (10%) (b) Given a binary search tree, please give an efficient procedure to generate the other binary search tree which has the same inorder ordering of keys. (10%) (c) If it is possible to have the third binary search tree has the same inorder ordering of keys. (10%)