Processing Arrays a. Suppose you have an unsorted array of integers of length n and want to sum all the elements inside it. What is the running time of your algorithm?_____ b. Suppose you have an unsorted array of integers of length n and want to determine if all the values inside are positive. What is the running time of your algorithm?_____ c. Suppose you have a sorted array of integers of length n and want to determine the median value. What is the running time of your algorithm?______ ____T/F f(n) = 3n^2 +4n + 2 belongsto theta(n^2) If true, prove it by giving integral values for the required constants c_1, c_2 and n_0. Choose the tightest values possible for the c_1 and c_2 constants. If false, show the contradiction