Insertion in Red$-$Black Trees

Given an initially empty red$-$black tree, perform successive insertions of the keys in the following order:

$11,14,2,1,7,5,8.$

For each insertion:

Draw the resulting red$-$black tree.

Clearly indicate the color of each node.

If any rotations or color changes are performed, briefly explain why according to the

red$-$black tree properties