8. Give the big-Oh characterization in terms of n. Input: An array A storing n1 of integers Output: The sum of the prefix sums in A. sA[0]ts for i1 to n1 do ss+A[i]tt+s return 9. Given an n-element array X, Algorithm A calls Algorithm B on each element X[i]. The B Algorithm runs in O(i) time when it is called on element X[i]. What is the worse-case running time on Algorithm A? 10. Order the following functions by asymptotic growth (slowest to fastest) rate: 212,nlog(n),5000n4,n6+n3+10,9n +10log(n),4nlog(n)+2n5,n2+10n,2n,log(n),2log(n)