Design an algorithm to find all the common elements in two sorted lists of numbers. For example, for the lists $2,5,5,5$ and $2,2,3,5,5,7,$ the output should be $2,5,5.$ What is the maximum number of comparisons your algorithm makes if the lengths of the two given lists are $m$ and $n,$ respectively?

a$.$ Find $gcd(31415,14142)$ by applying Euclid's algorithm.

What does Euclid's algorithm do for a pair of integers in which the first is smaller than the second? What is the maximum number of times this can happen during the algorithm's execution on such an input?