asap solution direct thumb up

(6) Consider the following two C functions: int MaxSumi(int S[], int n) { int sum int max- B; for (int i = 0; i max) max - sum; else if (sum max) max - sum; > > return max; } Express the worst-case computational complexity as a function of integer parameter n using Big-Oh notation, explaining your reasoning. int<>