insert$($D$),$ insert$($C$),$ insert$($B$),$ insert$($A$)$

remove$($C$)$

insert$($F$),$ insert$($E$),$ insert$($G$)$

remove$($D$)$

Draw the resulting tree after every removal operation, if a removal operation can be performed in two different ways resulting in two different trees after removal, draw both possible solutions. Please Draw each stage of the tree as the inserts and removals occur.