3. (U \& G-required) [30 points] Consider the following recursive algorithm: ALGORITHM Secret (A, lowIdx, highIdx) // Input: // - An array A[1.n] of integer numbers // - integers lowIdx, highIdx // Variables: // - integers midIdx, retValue, temp1, temp2 if lowIdx == highIdx return A[lowIdx] else midIdx =( lowIdx+highIdx)/2 temp1 \& Secret (A, lowIdx, midIdx) temp2 \& Secret (A, midIdx+1, highIdx) return temp1 + temp2 a) [10 points] What does this algorithm return? b) [20 points] Set up a recurrence relation for the algorithm's running time and solve