5. 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 atleast as large as the previous integer in the list.)