After you review Chapter 1 in your textbook and review all course materials attached below please answer the following question.
Assignment Question : Design and write 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?
You are required to respond to the assignment question posted above. Copying responses from another student or from the Internet is considered plagiarism even when changing a few words. When supporting your response you are required to provide at least one supporting reference with proper citation. Your response will be reviewed by Unicheck, the plagiarism tool synced to Canvas. Unicheck will submit a similarity report a few minutes after you post your assignment. If the similarity index is above 30%, please revise and resubmit your assignment after you cite the sources properly to avoid plagiarism. Please review the PowerPoint slides explaining how to avoid plagiarism and post your assignment accordingly. Even a single plagiarized statement will not be tolerated. You must cite your sources properly by using APA writing format.