Calculate T(n) and the order of complexity

Algorithm-3 recursive function MaxSumCKIL. Ul: array of integer, L, U: integer) if L> U en return 0 /k zero- element vector if L-U then. return max(0,XILD one-element vector A is XLL...M], B is XLM+1..U] Find max crossing to left sum 30: maxToLeft for I BM downto L do sum suman XII maxToLeft max(maxToLeft,sum) Find max crossing to right sum 0: maxToRight-0 for ISM-1 to U sum sum 10 maxToRight max(maxToRight, sum 11 12 maxCrossing maxToLeft maxToRight 13 maxInA maxSumCK, L, M) 14 maxInB max Sum(X, M+1,U) 15 return max(maxCross maxInA, maxInB ing