Which of the following statements are True about Red-Black Trees? Select ALL the TRUE statements. A Red-Black Tree with all black nodes is also an AVL Tree. At least one child of every black node must be red. The longest path from the root is no more than twice the length of the shortest path. Every AVL tree can become a Red-Black Tree by simply coloring nodes (without rotations). Every Red-Black Tree is an AVL Tree. Every Red-Black Tree is a Binary Search Tree. The root node can be red. If a node is red, then its children are black