Given the following pseudo code: Algorithm Ex(A, n): Input: An array A storing n greaterthanorequalto 1 integers. s leftarrow A[0] for i leftarrow 2 to n - 1 by increments of 2 do s leftarrow s * A[i] return s What is the Big-O order of the memory required by the algorithm? How many times is the statement in the innermost loop executed, as a function of n? What is the Big-O order of the operations required by the algorithm? What are the best and worst case scenarios of order of operations of this algorithm