(Solved): Time analysis of algorithm consisting of while loop in a for loop. As many explanations as possible ...

Time analysis of algorithm consisting of while loop in a for loop. As many explanations as possible for each line please and show all caluclations.

\[ \begin{array}{l} A=\{3,4,2,1,5,6\} \quad \text { start index }=1 \\ n=6 \end{array} \] 1: for \( i=1 \) to \( n \) 2: \( \quad \) sum \( =0 \) 3: \( \quad j=1 \) 4: while \( (j \leq n) \) 5: sum \( =\operatorname{sum}+A[j] \) 6: \( j^{++} \) 7: pritt sum Find \( t(n) \) ? Show unsimplified and \( \theta \) notation. Calculations + explanations!