Consider the following red$-$black tree containing keys $10,23,31,37,41,50,62,65,70,89,$ and $95$ :

Draw the red$-$black tree that results from inserting a node with key $15$ into this tree. Show the steps followed, i$.$e$.,$ draw the intermediary trees.