JAVA

Write a complete program in Java that counts the number of duplicates in a list of integer numbers. Your program receives a list of n numbers and outputs the total number of duplicates. Your algorithm should be of the order of (n2). Analyze your algorithm in detail. Justify why it is (n2).

Now consider the previous question, but this time assume you are given a sorted list of numbers. Now consider the sorted list and write a code to count the number of duplicates again. Analyze the time complexity of your algorithm in the worst case. Could you improve the worst- case time complexity of your algorithm compared to the previous question? Why? Explain.

Hint: Assume List = {1, 2, 1, 3, 3, 4, 3}; The list has one duplicate of 1 and two duplicates of 3, therefore total duplicates will be 1+2=3