Let = {,, ., , 0} be a non-empty sequence of integers. Give an () recursive divide-and-conquer algorithm to find the largest possible sum of a subsequence of consecutive items in . Example: = [10, -20, 3, 4, 5, -1, -1, 12, -3, 1] has the largest sum 22 (of subsequence [3, 4, 5, -1, -1, 12]). = [-1, 2, -5] has the largest subsequence sum 2 = [3, -2, 4, -6, 2] has the largest subsequence sum 5

Provide:

1. The recursive pseudocode of your divide-and-conquer algorithm
2. The explanation of its complexity
3. A Python function max_subseq that implements your algorithm.

Hint: Assume you can solve the problem for a sequence of - 1 integers. Think about what you need to go from a solution on a sequence of - 1 integers to a solution on a sequence of one additional integer.