A coding club holds an "algorithm race". Each team must find to pack 96 apples and 132 bananas into identical fruit baskets, and the team that checks the fewest numbers wins. Team 1 uses the first gcd algorithm and counts the divisibility checks made while listing the divisors of 96 and of 132. Team 2 checks each from 1 to . Team 3 checks downwards and stops at the first dividing both, counting that too.

(i) How many divisibility checks does Team 1 make?
(ii) How many numbers does Team 2 check?
(iii) At which does Team 3 stop, how many numbers does it check, and which team wins?
