We insert the following elements in the following order into an empty red$-$black tree: P$,$ R$,$ C$,$ Z$.$ Show the resulting tree after each insertion and if there are any violations of the red$-$black properties, show how that violation is fixed.