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!).

i'm so sorry that's not a question and this isn't an answer

solution:

the auto-correct option of the auto-correct tool enables you to add and delete words that do not follow abbreviation rules because:

it is a feature that allows outlook to correct common spelling and typing errors and to replace characters with symbols. we can also can use auto-correct as a shortcut, which means we can type a small string of characters and have those characters replaced by a longer string.

answer///copyrights protects;

answer///radio frequency interference (rfi);