$"$C$++$ Write a program $($in main.cpp$)$ to do the following:

a$.$ Build a binary search tree T$1.$

b$.$ Do a postorder traversal of T$1$ and, while doing the postorder traversal, insert the nodes into a second binary search tree T$2.$

c$.$ Do a preorder traversal of T$2$ and, while doing the preorder traversal, insert the node into a third binary search tree T$3.$

d$.$ Do an inorder traversal of T$3.$

e$.$ Output the heights and the number of leaves in each of the three binary search trees.

Note: You may need to create new binary tree methods that perform the actions above.

The program should accept input and produce output similar to the exa XH$09$ mple below:

Enter numbers ending with $-999$: $1057-999$

tree$1$ nodes in postorder: $7510$

tree$2$ nodes in preorder: $7510$

tree$3$ nodes in inorder: $5710$

tree$1$ height: $3$

tree$1$ leaves: $1$

tree$2$ height: $2$

tree$2$ leaves: $2$

tree$3$ height: $2$

tree$3$ leaves: $2"$