(i) Checking every j from 1 to 66, and from 1 to 110:
divisors(66)=[1,2,3,6,11,22,33,66]
divisors(110)=[1,2,5,10,11,22,55,110]
(ii) For each x in divisors(66), check whether it is in divisors(110): 1 yes, 2 yes, 3 no, 6 no, 11 yes, 22 yes, 33 no, 66 no.
common-divisors =[1,2,11,22]. The rightmost element is the gcd: gcd(66,110)=22.
(iii) The number of kits must divide both 66 and 110, and the largest such number is 22. So 22 kits can be made, each with 66÷22=3 pencils and 110÷22=5 erasers.