5. Draw an AVL tree for the following values inserted in this order. Illustrate the tree for each rotation that occurs: 50 26 65 13 16 28 11 20 52 35 30 10 points 6. For the splay tree shown below, show how an access of node 55 is performed. Illustrate the tree for each operation that occurs: 10 20 1530 2540 35 50 60 10 points 7. For the splay tree shown below, show how an access of node 40 is performed. Illustrate the tree for each operation that occurs: 90 3095 20 70 10 60 80 45 40 50 10 points 8. For the B+-tree where M=3 and L=5 shown below, show how an insert of value 80 is handled. Resolve overflows by splitting. || 12 || 50 || - - Ooo on NOVO