ComputeSumLowerTriangular$($L$,$n$)$

inputs: L is an nxn matrix. n is the dimension of the matrix

output: a real number equal to

$1$: sum $=0$

$2$: for i $=$ n to $1$

$3$: psum $=0$

$4$: for j $=1$ to i

$5$: psum $=$ psum $+$ L$[$i$,$j$]$

$6$: sum $=$ sum $+$psum

$7$: return sum

All the questions in this exercise are related to the ComputeSumLowerTriangular$($L$,$n$)$ algorithm. The objective of this exercise is to explore whether the asymptotic time complexity will change if we count different $$actions$.$

$(8$ points$)$ Based on b$,$ express the total number of comparisons performed by the inner $$for loop$$ in Line $4$ only during the execution of the algorithm. $($See how Student $3$ gets full credit$)$

answer here $...$