Suppose is a one-dimensional array and consider the following algorithm segment: su...

Suppose is a one-dimensional array and consider the following algorithm segment:

sum := 0

for k := 1 to m

sum := sum + a[k]

next k

Fill in the blanks below so that each algorithm segment performs the same job as the one given previously.

a. sum := 0

for i := 0 to __________

sum := __________

next i

b. sum := 0

for j := 2 to __________

sum := __________

next j