1. You will be implementing a basic B tree (a,b) with a=2 and b=4.

The tree node should have one integer for the data and the rest of the fields are the links to the children and the parents. The node size and depth properties of the B trees should be maintained throughout the entire process of insertion and deletion.

You have to perform three operations on the B ttree:

• Insert a node into the B tree while preserving the B tree properties and handling overflow through merging
• Delete a node from the B tree by handling the following cases through underflow and split
• the node has its sibling as a 2-node
• the node has its siblings as 3-node and 4-node

• Print: This function should begin by printing a small header containing the size of the tree. Then it should perform an InOrder traversal of the tree, printing out each element as it traverses the tree.

2) implent an AVL Tree and implement insertion and deletion operations keeping the balance factor into account.