Could someone help explain this to me? Please explain using clear explanation since I'm a bit confused on it. Please don't give the same explanation/solution that is already available on Chegg - I've read those already, and I'm still a bit confused. Thanks for your help!

Consider a red-black tree formed by inserting nnodes with RB-Insert. Prove that if n> 1, the tree has at least one red node. Hint:Nodes are red when inserted (line 16 of RB-Insert). Show that if n> 1 one node must be red after RB-Insert-Fixup is complete. (It is not sufficient to say that the second node inserted will be red. You must show that some node remains red under all possible insertion sequences and the transformations that result.)