Describe an algorithm that takes as input a list of n integers in non-decreasing order and produces the list of all values that occur more than once. (List of integers

is non-decreasing if each integer in the list is at least as large as the previous integer in list.)