derive through a precise arithmetic analysis the asymptotic tight bound () of the running time complexity in terms of the total number of the additions performed on elements of the array A. Hint: you may find one or more of the following summation formulas useful: n k=1 k = n(n+1)/2. n k=1 k 2 = n(n+1)(2n+1)/6. n k=1 k 3 = n2 (n+1)2 /4

6. Consider the following basic problem. You're given an array A consisting of n integers A[1],A[2], You'd like to output a two-dimensional n-by-n array B in which Bli,jl (for i