Learning Goal: I’m working on a algorithms & data structures exercise and need a

Learning Goal: I’m working on a algorithms & data structures exercise and need an explanation and answer to help me learn.In Assignment 9, you wrote the Map ADT similarly to the std::map, but the underlying tree is notbalanced. To guarantee O(logN) performance, you must upgrade the BST into an AVL tree.You need to create a header file, map.h, based on Assignment 9 and according to your currentimplementation. The public interface of the Map container must remain the same as in Assignment 9,with only one exception: the erase() method is not required. Meanwhile, other Map operations, suchas the constructors and destructor, the one-directional Map iterator, operator[], must all be supported.The Map container must be generic and implemented as a class template, so it can be instantiated asMap, for example. You may add other methods as you see fit.Make sure you keep the overloaded operator << and printTree() methods provided in the map.cpp fileunchanged, in order for the graders to verify your results. A good starting point for this assignment isto take what you did for Assignment 9P, add pieces from Lab 9 where you had a simple AVL treewritten under the hood of a Set ADT, and make some modifications for threads in the rotation/heightcode.To test your program, you can reuse the test cases for Assignment 9, excluding the tests for erase()method. You should check the tree printout and verify the AVL tree is correct.Note that the std::map() container can only be used as in the starter code of Assignment 9. Otherusages of STL containers are not allowed. In addition, you must implement an AVL tree in thisassignment, not any other types of balanced search tree (for example, a Red-Black tree).