Please

answer the following

in this problem you will compute that asymptotic take time complexity of the following divided and conquer algorithm you may assume that a is power of 2

2. [5 Points] In this problem you will compute the asymptotic time complexity of the following divide-and-conquer algorithm. You may assume that n is a power of 2. (NOTE: It doesn't matter what this does!) float useless (A) { n = A.length; if (n==1) { return A[0]; let A1, A2 be arrays of size n/2 for (i=0; i