Problem 3 (20 pts): Your exam consists of n questions from 1 to n. The i-th problem is worth pi points. You must answer questions in order, but you can skip questions since some questions are very time- consuming, and it may not be worth spending too much time on the the i-th question for p points since you will not have time to solve the next f questions. Given each question's point worth p, and f, value, design an algorithm and write pseudocode to choose a set of questions to answer in order to maximize your point total. Compute the asymptotic worst-case running time as a function of n. Problem 3 (20 pts): Your exam consists of n questions from 1 to n. The i-th problem is worth pi points. You must answer questions in order, but you can skip questions since some questions are very time- consuming, and it may not be worth spending too much time on the the i-th question for p points since you will not have time to solve the next f questions. Given each question's point worth p, and f, value, design an algorithm and write pseudocode to choose a set of questions to answer in order to maximize your point total. Compute the asymptotic worst-case running time as a function of n