2. (20 points) Consider the following function : void Doit ( itemType a[ ] , int n , int L , int H ) if (n > 0 ) Process ( a , n , L , H ) ; Doit ( a , n-1 , L , H ) ; If the function Process does n logn arithmetic operations, Find the number T(n) of arithmetic operations done by this algorithm. Find the complexity (Big-O) of Doit (a , n, L , H) in terms of n