Arrange the steps in the correct order to devise an algorithm that finds all the terms of a finite sequence of integers that are greater than the sum of all the previous terms of the sequence Rank the options below
a. Sum := sum + ai
b. procedure find all biggies(an, a2. .. an: integers)
c. return L (the list of all the values that exceed the sum of all the previous terms in the sequence)
d. if a> sum then append a to L while isn
e. set L to be the empty list sum=O i=1