Insert the following into an initially empty red$-$black tree: $4,7,12,15,3,5,14,18,16,17.$ When an insertion causes an

RB property to be violated: stop, indicate the problem, and fix it before performing a new insertion.