e. Compute the running time of the following algorithm: (3 Marks) Algorithm Ex3(A): Input: An array A storing n1 integers. Output: The sum of the prefix sums in A. for i 0 to n-Ido for j 1 to i do return s a. Rewrite the linearSearch algorithm given below to output all positions of the element x in the array L, where S is the set of all elements in L. (5 Marks) Algorithm LinearSearch(x, L, n) Input: Array L. value . and number n of elements in S Output: Position i. 0-i