For the sports-day march-past at a school in Lucknow, the three houses have 112 (Red), 140 (Blue) and 154 (Green) students. The sports teacher wants marching teams that all have the same number of students. Each team comes from a single house, every student is in a team, and the teams should be as large as possible. She starts by finding the divisors of each house strength with the algorithm that checks every from 1 up to the number.

(i) Counting each divisor once, how many entries does have?
(ii) Write the list of common divisors of 112 and 140.
(iii) Find the largest team size that works for all three houses, and the total number of teams.
