Kabir has 80 chocolate bars and 140 toffees to share into identical gift bags. He already has the two lists of divisors, each in increasing order:

He finds the common divisors by scanning both lists together: compare the current entry of each list; if they are equal, record the number and move on in both lists; otherwise move on in the list with the smaller entry. He stops when either list runs out. Count one comparison each time he compares two entries.
(i) Write the list of common divisors of 80 and 140.
(ii) How many comparisons does Kabir's scan make?
(iii) His friend instead takes each of the 10 entries of the first list and compares it with all 12 entries of the second list. How many comparisons is that? Why does Kabir's method need so many fewer?
