1.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?

2. a. Find gcd(31415, 14142) by applying Euclids algorithm.

b. Estimate how many times faster it will be to find gcd(31415, 14142) by Euclids algorithm compared with the algorithm based on checking con- secutive integers from min{m, n} down to gcd(m, n).