Left ALGORITHM TestAlg (Arr., left, right) ( For solving a certain problem, one devised TestAlg, given below: (Expected 15 minutes) ( if (left < right) q=(left + right)/4 if (q is odd) TestAlg (Arr, left,q) AddTeaToSubarray(Arr, q + 1,2 - q) else TestAlg(Arr. 2. q + 1, 3-q) AddTenToSubarray(Arr. 3-q+1, right) } ALGORITHM AddTenToSubarray(A. x,y) for i = x to y A[i] = A[i] + 10 } 1. (1 pt) Which algorithm design technique is used in this algorithm?. 2. (4 pts) Derive the running time currence T(n) of "TestAlg". 3. (3 pts) Provide the asymptotic (big-0) notation for the time complexity of 'TestAlg'. nalysis and Design