Question 6 - 20 points

Given an array A = [23, -10, 14, -20, 16, -8, 12, -2] and we want to find the

sum of maximum subarray (1) Explain how the divide and conquer algorithm

solve this problem. Show level by level results and final result. (2) Explain how

the dynamic programming algorithm solve this problem. Show how you fill the

memorization table and get the final result.