Non-recursive algorithm complexity analysis. (10 points)
What is the total execution time T(n) of the following code segment? In your submission, please follow the following format:

Line no.,    time to run this line once,   number of times to run this line
For example, you will have the following for the first line:
1,  C1,  1

  funkyFunc(A[n] ) {//A is an array of n numbers
1.     Sum = 0;
2.     for (i=1; i<=n; i++)  {
3.           for (j=i-1; j<n-1; j++)
4.                 sum = A[i] * A[ j ];  }
5.      return sum;
}