Please program in C++

1 A most uncommon tree The AA tree is a rare kind of a self-balancing bi- nary search tree. This type of tree isn't commonly used, but it makes for a good student project, as it is simpler than the usual RB or AVL trees. 2 The task at hand Implement the AA tree. You can find instructions on how such a tree operates online. Submit the code which inserts 10000 randomly-generated items into your binary search tree, prints the maximum depth of the tree and prints all items in sorted order. Also, compare the timing of inserting 10000 items into a heap with the timing of inserting 10000 items into an AA tree. Also, count swaps that occur in a heap and the tree rotation/balancing operations. Report all of those statistics at your program's exit. 1 A most uncommon tree The AA tree is a rare kind of a self-balancing bi- nary search tree. This type of tree isn't commonly used, but it makes for a good student project, as it is simpler than the usual RB or AVL trees. 2 The task at hand Implement the AA tree. You can find instructions on how such a tree operates online. Submit the code which inserts 10000 randomly-generated items into your binary search tree, prints the maximum depth of the tree and prints all items in sorted order. Also, compare the timing of inserting 10000 items into a heap with the timing of inserting 10000 items into an AA tree. Also, count swaps that occur in a heap and the tree rotation/balancing operations. Report all of those statistics at your program's exit