Quiz: Query Decomposition

You want to find the $13$th ancestor of a node using binary lifting. Which jumps does the algorithm perform?

1. A.Jump $13$ steps in one operation
2. B.Jump $10$, then $3$ steps
3. C.Jump $8$, then $4$, then $2$ steps
4. D.Jump $8$, then $4$, then $1$ step