Write down a sequence of numbers in the order that the k$-$d tree is traversed when checking

intersections between a ray and the scene. Each number at an internal node represents the intersection

test between the ray and the axis$-$aligned bounding box corresponding to the node. The numbers at the

leaf nodes represents the intersection test between the ray and the primitives. The number at the arrow

represents the tree traversal. Omit numbers that correspond to pruned operations $($that are not

executed$).$ Do not exclude intersection tests that fails; for example, the correct answer is $1$ if the ray

doesn't collide with the outer$-$most bounding box, not an empty string $.$