Write in C+ code

4. Draw the binary search tree whose root node is the 7th and 8th digit of your id i.e. ID: 2221078842, the root node is 88, and elements are inserted in the following order. 52 75 93 97 105 28 13 11 9 2 10 25 19 54 16 18 95 Print the elements of the tree after deleting uodes 9.2, 25. Now insert new 11odes 22, 100 and print the elements in the tree (postorder). [ Just write the main.cpp must use the class included in your final syllabus to solve this problem] 8