Devise an algorithm that finds all modes. (Recall that a list of integers is nondccreasing if each term of the list is at least as large as the preceding term.)

Step 1:

We have to write an algorithm to finds all modes. (Recall that a list of integers is nondecreasing if each term of the list is at least as large as the preceding term.)

Step 2:

An algorithm is a method to solve in a finite sequence of instruction for computing or solving the given problem.

We have to find a mode in a list of nondecreasing integers.