A school library in Lucknow has received 288 Hindi books and 432 English books. The librarian wants to put them into identical boxes, each with the same number of Hindi books and the same number of English books, using as many boxes as possible and boxing every book. She uses the first algorithm for gcd: find the divisors of each number by checking every number from 1 up to it, then keep the divisors of 288 that also divide 432.

(i) How many entries does have?
(ii) How many entries does the list common-divisors have?
(iii) How many boxes does she use, and what is in each box? How many divisibility checks does the algorithm make while finding the two lists of divisors?
