Consider an integer list A[0..n-1] that includes negative and positive integers. Find thelongest all-negative subsequence.

Example: For the input: [2, 5, 0, -3, -5, 0, -1, -2, -1, 2]; Output is: [-1, -2, -1]

?t must be designed as divide&conquer algorithm, step by step description and code