The leaf layer of a b$-$tree index contains:

Group of answer choices

The values of the keys to the indexed records

A list of pointers to the branch $($internal$)$ nodes of the index

A bitmap of all key values of the indexed records

RBA pointers to the root node

One byte for each data values that appears in the indexed column