Use the following selection sort algorithm to answer the questions below:

a) Identify the straight-line code in the above algorithm.

b) Fill in the following table that counts the number of times that the innermost piece of code will be executed.

c) Sum the last column of the table and simplify as much as you can.

d) Based on your answer to part c what is the runtime of the algorithm?

\begin{tabular}{|c|} \hline Iteration \# Value of i \# of executions \\ \hline 1 \\ \hline 2 \\ \hline 3 \\ \hline n2 \\ \hline n1 \\ \hline \end{tabular}