Perform the following problems.
problem 1) prepare a non recursive function to insert the node in AVL tree.
problem 2) prepare a non recursive function to delete a node from an AVL tree.
problem 3) prepare a recursive function to delete node from the AVL tree.
problem 4) prepare a function to merge the nodes of two AVL trees to obtain a new AVL tree.
problem 5) prepare a functions to determine the immediate predecessor and immediate successor of a given key value in a B-tree.
problem 6) prepare a function to insert new key to a B-tree of order “m”.
problem 7) prepare a function to delete the existing key from a B-tree of order “m”.
problem 8) prepare a program to divide unsigned number by another number using bitwise operators.
problem 9) prepare a program for Hanoi problem.