Search in M-way Trees

Searching for X:

1. If X < V(1), recursively search in V(1)'s left subtree.
2. If X > V(k), recursively search in V(k)'s right subtree.
3. If X = V(i), for some i, X is found!
4. Else, for some i, V(i) < X < V(i+1); recursively search in subtree between V(i) and V(i+1).

Search for 68 in:

What about 69?