Given a one-dimensional array of integers, you have to find a sub-array with maximum sum. This is the maximum sub-array sum problem. Which of these methods can be used to solve the problem?

• A. Dynamic programming
• B. Two for loops (naive method)
• C. Divide and conquer
• D. All of the mentioned