C++ program that maintains its data (of type integer) sorted in ascending order. The program will consist of three functions: insert, delete, and print. You may use any data structure of your choice as long as the data remains sorted after each operation.
For example, if 5 is inserted then 2, the structure should contain 2 then 5, and that's what the print function should show. If 3 is inserted afterward, then we should have 2,3,5. Same for deletion, of course, the structure will remain sorted, but the deleted number should be excluded.