(a) Insert the following sequence of elements into an AVL tree, starting with an empty tree: 11, 20, 15, 25, 35, 16, 17, 19 and delete 35 in the AVL tree that you got. [Show step by step implementation] (b) Insert the following keys to a 5-way B-tree: 3,7,9, 23, 44, 1, 5, 14, 25, 24, 13, 11, 8, 19, 4, 31, 35 and derive the formula for height of this tree. (c) Three doubly Link Lists P1, P2 and P3 of sizes N1, N2 and N2 are existing. Assume P1, P2 and P3 are pointed to the first node of the Doubly Link Lists. You need to write a program to find the number of dissimilar and similar nodes(data) in these three lists. Derive the time and space complexity for the same