Question 1 of 5
List L has 6 sorted numbers. Algorithm Scan checks items from left to right. Algorithm Halve repeatedly discards half of a contiguous remaining region (assume perfect halves: 6→3→2→1 counting region sizes after each check decision). (a) How many checks does Scan need in the worst case? (b) Count the region-size steps 6, 3, 2, 1 and state how many reductions occurred. (c) Which algorithm uses fewer checks on this n as described?