1.a) For the original tree given below. write down the preorder, inorder and postorder traversals. 44 26 35 14 33 31 10 42 19 27 b) With the help of examples, explain what is the lower bound and what is the upper bound of the height of a decision tree.