6. Suppose you are given an array A[1..n] of integers, each of which may be positive, negative, or zero. A contiguous subarray A[i.. j] is called a positive interval if the sum of its entries is greater than zero. Describe and analyze an algorithm to compute the minimum number of positive intervals that cover every positive entry in A. For example, given the following array as input, your algorithm should output the number 3. sum 2 sum 1 sum 7 +3-5 +7-4+1-8 +3-7+5-9+5-2 +4 6. Suppose you are given an array A[1..n] of integers, each of which may be positive, negative, or zero. A contiguous subarray A[i.. j] is called a positive interval if the sum of its entries is greater than zero. Describe and analyze an algorithm to compute the minimum number of positive intervals that cover every positive entry in A. For example, given the following array as input, your algorithm should output the number 3. sum 2 sum 1 sum 7 +3-5 +7-4+1-8 +3-7+5-9+5-2 +4