C$++$Analyze the problem,

describe your data structure

and the complexity of it and its operations $($Big$-$O$),$ to solves the problem.

For example, if $5\mathrm{.}0$ is inserted then $2\mathrm{.}9,$ the structure should contain $2\mathrm{.}9$ then $5\mathrm{.}0,$ and this is what the print function should show. If $3\mathrm{.}3$ is inserted afterwards, then we should have $2\mathrm{.}9,3\mathrm{.}3,5\mathrm{.}0.$ Same for deletion, of course the structure will remain sorted, but any deleted number should be removed and excluded from printing.

Capture screenshots of the operations below:

Insert $5\mathrm{.}0$ then $2\mathrm{.}9$ then $3\mathrm{.}3($in this order$)$ and print the content after each insertion.

The printed list should be sorted in every print call.

Delete $3\mathrm{.}3,$ then print the content again.