A game designer shares 42 red gems and 70 blue gems into identical prize bags, making as many bags as possible. She finds the gcd by keeping only one number, most-recent-common-divisor: it starts at 1, and for each , if divides both 42 and 70, it is updated to . She starts the trace table below.

(i) For which values of is most-recent-common-divisor updated?
(ii) Counting each value of once, how many values does she check?
(iii) How many bags does she make, and what is in each bag?
