Farhan has 28 apples and 42 oranges to share equally among the largest possible number of children. He runs the first algorithm for gcd: he finds and , then goes through the divisors of 28 one by one and adds each one that is also a divisor of 42 to the list common-divisors.
Two statements are given below. One is labelled Assertion (A) and the other is labelled Reason (R). Read the statements carefully and choose the option that correctly describes statements A and R.
Assertion (A): The list common-divisors that Farhan gets is , so he can report its rightmost entry, 14, as .
Reason (R): Farhan takes the divisors of 28 in increasing order and keeps only those that also divide 42, so the numbers he keeps are also in increasing order.
