1. In the previous homework, we considered a problem where the input is an array P[n that records the daily net profit of a store. The goal is to find an interval [i, j] so that the total net profit of this interval is the least among all intervals in (I,n]. Last week, you designed a divide and conquer algorithm that solves the problem. This week, you have to design a dynamic
OR
OR