Select all of the statements that are true regarding the structure of a Red$-$Black Tree.

$$ The values are stored and removed to satisfy last$-$in$-$first$-$out $($LIFO$)$ access property.

$$ The values are stored and removed to satisfy first$-$in$-$first$-$out $($FIFO$)$ access property.

$$ It is a collection of linked data structures called nodes.

$$ The underlying structure is often a heap.

$$ Each node has an extra bit of data that is used to ensure the structure remains approximately balanced during insertions and deletions.

$$ It supports direct access by index.

$$ The key at the root node has the minimum key value among all nodes.

There are no cycles $($circular references$)$ in the structure.

$$ Each node has either two children and one data element or three children and two data elements.