In a list of elements the same elements may appear several times. A mode of such lust is an element that occurs at least as often elements; a list has more than one mode when more than one element appears the maximum number of timesDevise an algorithm that finds all terms of a finite sequence of integers that are greater than the sum of all previous terms of the sequence.

Solution:Step 1:We are required to compose an algorithm that finds all terms of a finite sequence of integers that are greater than the sum of all previous terms of the sequence.We initially investigate what an algorithm is and the essential steps to be followed in composing an algorithm.Step 2:Definition of algorithm: An algorithm is an all around characterized system that enables a PC to take care of an issue. Another approach to describing an algorithm is an arrangement of unambiguous directions. The utilization of the expression "unambiguous" shows that there is no space for subjective understanding. Each time you request that your PC do a similar algorithm, it will do it in the very same way with precisely the same.Step 3:Algorithm: procedure greater(a1,a2, a3……..an: integers)Sum:= 0{this stores the whole of the considerable number of qualities taken up so far.}K:=1For i:= 1 to nIf ai > sum then Output:= aiK:= k+1Sum:= Sum +ai