Insert items with the following keys $($in the given order$)$ into an

initially empty red black tree: $6,3,12,15,27,9,18,21.$ Draw the red black

tree after each insertion.