Chapter 5.1, Problem 80ES

Suppose $a\left[1\right],a\left[2\right],a\left[3\right],\mathrm{....}a\left[m\right]$ is a one-dimensional arry and consider the following algorithm segment:

$\begin{array}{l}sum:=0\\ \text{for}k\text{:=1}\text{to}m\\ sum:=sun+a\lfloor k\rfloor \\ nextk\end{array}$

Fill in the blanks below so that each algorithm segment performs the job as the one shown in the exercise statement.

a. $\begin{array}{l}sum:0\\ \text{for}i:=0\text{to\_\_\_\_\_}\\ \text{sum:=\_\_\_\_}\\ \text{next}i\end{array}$
b. $\begin{array}{l}sum:0\\ \text{for}i:=2\text{to\_\_\_\_\_}\\ \text{sum:=\_\_\_\_}\\ \text{next}j\end{array}$