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.)

see explanation

step-by-step explanation:

a

(6r + 7) + (13 + 7r) ( remove brackets and collect like terms )

= 6r + 7 + 13 + 7r

= 13r + 20

b

remove brackets and collect like terms

13 - r - 1 + r

= 12 - r

c

remove brackets and collect like terms

= - 8 - r + 2r - 4

= - 12 + r

d

remove brackets and collect like terms

= 7r - - - 6r

[-   - = - - = - ]

= r -

step-by-step explanation: