a) Construct the AVL tree by inserting the integer keys: Marking Scheme: 9,27,50,15,2 and 21 in the given order into an initially. a. Each insertion: X mark. Each rotation 1 mark. b: Each insertion mank. Correct answer for empty AVL tree. Show all the trees separately that result after each insertion. Apply rotations to balance them if needed and show all steps: b) Insert the following numbers (in the order that they are shown from left to right) into a hash table with an array of size 10 , using the hash function, H(x)=xmod10. 288,123,635,715,453,325,633,809 Use closed hashing and resolve collisions through linear probing. After storing this data in the hash table, if you need to search for a key 133 , how many comparisons you will need to make before you can say that the item is not found