a. A balanced binary search may be balanced or unbalanced based on the arrangement of the nodes of the tree. With you knowledge in Binary search tree: ii. Explain the best and worst case scenarios of the time and space complexity of both type of binary trees above. Using your own binary tree, a. perform an inorder, preorder and a postorder traversal b. provide the algorithm for the traversals above marks 10 b. Stacks are an important data structure in their own right and they may be implemented in several ways. Implement a stack as an array and Write functions to perform the following operations on it. With each operation explain the time complexity associated with it when performed a. Push() b.pop() c. size() d. peek() 10 marks Briefly explain any two problems when stacks are implemented as an array. marks 5