Write a C$++$ program to build an AVL tree by accepting the integers input from users. For each input, balance the tree and display it on the screen; you then calculate the preorder, inorder and postorder traversals as well. Apply Object$-$Oriented Program $($OOP$)$ by using class or struct$/$objects and separating the source code into multiple files.$$There should be a menu to drive the program. $$It should be similar as follows:

$$AVL Tree Implementation

$$ A: Insert an integer to a tree and show the balanced tree at each insertion.

$$ B: Display the balanced tree and show preorder traversal.

$$ C: Display the balanced tree and show inorder traversal.

$$ D: Display the balanced tree and show postorder traversal.

$$ E: Exit

To be sure, your program is correctly working, use the following data to test AVL tree:

$15,18,10,7,57,6,13,12,9,65,19,16,23$

You should perform more test with different data sets.$$

Sample output attached.