a) Insert into an initially empty binary search tree items with the following keys (in this order): 3,22,54,1,7.

b) How many different Binary Search Trees are possible using the above sequence? (3,22,54,1,7).

c) The inorder traversal of the Binary Search Tree at a) is 1,3,7,22,54. Build a different Binary Search Tree whose inorder traversal outputs the same sequence.