In c++

When writing BST algorithms, you need to be able to print the tree in a hierarchical order to verify that the algorithms are processing the data correctly. Write functions to create a BST and then to print the tree. The printed output should contain the node level number and its data. Present the tree using the format as shown below for the following hierarchy of Meats. 4. Bacon 4. Duck 3. Chicken 2 Lamb 3. Nuggets 5. Turkey 4. Steak 3. Roast Beef 2. Pork 1. Meat