Show the red$-$black trees that result after successively inserting the keys $41$;$38$;$31$;$12$;$19$;$8$ into an initially

empty red$-$black tree. You need to show the tree after each insertion. If the insertion violates the RB tree

property, you need to point out the FIXUP case and the operation.