Navigation and Range Scan Checkpoint

1. With internal separator keys [10, 20], key 20 should route to:

The child right of separator 20 The child left of separator 20 Both children No child

2. A range scan first does an index descent using:

The lower bound of the range The upper bound of the range A random middle key Every key in the range

3. True/False: Linked leaves are mainly useful for equality lookup.

4. If a leaf currently has keys [2, 5, 9] and the query is [4, 8], which keys are returned from this leaf?

5 2 and 5 5 and 9 2, 5, and 9