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

answer: 1, 3 and 5 are correct

step-by-step explanation:

dont trust me im no expert these losers made me fail a test bro this sucks

step-by-step explanation:

5x + 3y = - 4

step-by-step explanation:

the equation of a line in standard form is

ax + by = c ( a is a positive integer and b, c are integers )

express the line first of all in slope- intercept form

y = mx + c ( m is the slope and c the y-intercept )

to calculate m use the gradient formula

m = ( y₂ - y₁ ) / ( x₂ - x₁ )

with (x₁, y₁ ) = (7, - 3) and (x₂, y₂ ) = (4, - 8)

m = = -

y = - x + c ← is the partial equation

to find c substitute either of the 2 points into the partial equation

using (4, - 8 ), then

- 8 = - + c ⇒ c = -

y = - x - ← in slope-intercept form

multiply all terms by 3 to eliminate the fractions

3y = - 5x - 4 ( add 5x to both sides )

5x + 3y = - 4 ← in standard form

80

step-by-step explanation: