6 a) Construct a Binary Search Tre using the followving dats: (5 pas) 4,6,5,2,8,6,1 b) Now illustrate how to search for V-7 from the binary search tree. How many searches are required. (3 pts) c) Give the preorder and postorder tree traversals for this tree (2 pts) 7. a) How an AVL tree is different from a binary search tree? (3 pts) b) What is a balance factor in an AVL tree? (2 pts) e) Illustrate how would you construct an AVL tree using the following data: 5, 10, 15, 20 (5 pts) 8. Write down the recursive function to compute Factorial of an integer N. (10 pts)