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 $$ and $,$respectively$?$