A red$-$black tree $($RBT$)$ T is shown in the following figure, where the nil nodes are not shown.

We want to delete the node with key $50$ from the tree. Necessary deletion fixup operations are carried out $($using the algorithm taught in class$)$ so that the resulting tree is still a red$-$black tree.

What is the right child of $K?$