Consider an assignment with n questions. For each i (1 i n), the ith question has pi points and time ti associated with it (both positive integers). Design an O(nP) time algorithm to compute the minimum time required to obtain a target of P points. (Assume that you either get full points or 0 on each question. Of course, this is not true in our course!).