Describe an algorithm that takes as input a list of n integers in nondecreasing order and produces the list of all values that occur more than once. (Recall that a list of integers is nondecreasing if each integer in the list is at least as large as the previous integer in the list.)

Solution: Step 1</p>

In this problem we need to write an algorithm that takes a list of n nondecreasing integers as input and produce the list of all integers which are occurring more than once.