which has the best time complexity?

Given a non-empty array art with integers both positive and negative, find the maximum sum contiguous subarray within atr which has the largest sum. def solutioncarr): max_so_far - arr[@] curr_max = arr[@] for 1 in range(1, len(arr)): curr max = max(arr[i], curr max + arr[i]) max_so far = max(max so far, currumax) return max so far What is the runtime of this solution (using blo-O notation? On) QH132) On 3) Ollogn) n = Given a non-empty array arr with n Integers both positive and negative, find the maximum sum contiguous subarray within arr which has the large def solutionB(arr): len (arn) max so far = arr[@] for i in range(n): sum= for j in range(i, n): sum += arril if sum > sum so far: max_so_far sum return max_so_far What is the runtime of this solution (using big-O notation)? O(n) On 2) Oln 3) Oln logn) Given a non-empty array arr with n integers both positive and negative, find the maximum sum of a contiguous subarray within arr. def solutionA(arr): n = len(arr) max_so_far = arr[@] for i in range(n): for j in range(i, n): sum= for k in range(i, j + 1): sum += arr[k] if sum > max_so_far: max so far = sum return max_so_far What is the runtime of this solution (using big-O notation)? Oln) Oln 2) | Qn^3] Ollogn