I need solution in 1 30 hours

language c++

Question 2: (a)-Following is the Balanced AVL-Tree-after deleting nodes::11, 33-and-9-what-do you think-after-deletion tree will be an AVL tree- or not? Also show proper steps-for-nodes deletion? Give reasons in both cases? (05) 33 53 8 21 11 (b)-Create-a-Huffman tree-for following data? Also calculate the message encoding size along with table? Message: 'Learn:Data Mining (05+05) 1 Question 3: Apply the single-source-shortest path-Algorithm on the given graph-consider-starting vertex=C?.Also calculate the shortest Path from S-to-E? (10)1 2 a 1 1 1 S 2 3 e 5 2 b 2 Q4. Consider a-hash-table with 10-positions and-hash-function:- h (k)=- 2K+3-and-h-(k)=3k+1?-Keys are inserted in the following order: 3,4,8,7,6,5,11,10 also draw the resulting array? (15) (a)-Use Division method. (6) Use hashing with Quadratic-Probing. I (c) Use hashing with Double-Probing (d) Specify the no of position probed for each key (e) Specify the order of values-inhash-table