Assuming that the bug is corrected.

The assignment statement "M[j][i] = 0.0" will be executed how many times? (Options: n, n^2, n^2 - n, (n + 1)^2 )

In total, the inner loop will perform how many comparisons?

This total number of comparisons, additions and assignment (M[j][i] = 0.0) of this algorithm grows as? (Options: n, n^2, Constant, (n + 1)^2, None of these answers)

InitializeMatrix(M) 1: //Initialize Matrix to 0.0 for each element 2: for j 1 to n 3: 4 S: return fori 1 to n-1