Q2. Consider the following algorithm that accepts an array of integers A[low returns a single value high] and Algorithm Weird (int A], int low, int high) ( if (low - high) return A[low]; end if; n high - low + 1; vall -Weird (A, low, low + n/4 - 1); val2 Weird (A, low + n/4, low + n/2-1); val3-Weird (A, low + n/2, low + 3*n/4 - 1); val4 - Weird (A, low + 3*n/4, high); va 15 0; for i forj 1 to i if A[i] > A[j] va15 = va15 + A[j]; end if; end for; end for; return vall + val2+ val3 + val4 + va15; Find the time complexity of the algorithm in terms of 0O notation, by considering the number of element comparisons. Show your work clearly