Please only do the first question and use pseudocode

1. Given a sequential list with n numbers, represented in a one dimensional array A)Write an algorithm to check if the list has any duplication Explain the time complexity of your algorithm Can you think of a better algorithm to do the job? If so, briefly explain B) Write an algorithm to find all the duplicate numbers in the list, if any. Explain the time complexity of your algorithm Can you think of a better algorithm to do the job? If so, briefly eXplain