The naive solution for the maximum sub array problem is to calculate the sum of all sub arrays starting with every element and returning the maximum of all sub arrays. As discussed in the class, we can solve this problem using Divide and Conquer as well. What is the time complexity of the divide and conquer algorithm discussed in class.

$0($n$)$

$0(10$g $($n$))$

$0($nlog$($n$))$

$0($n$)$

$$None of the given options are correct