Question 1: (50 pts) Consider the following 0/1 Knapsack Problem Input: n items, values v = () volutne w - (...), total volume w. Output: The item selections 24, and total value VT 1. (20 pts) Give the pseudocode of a Dynamic Programming (DP) algorithm for the 6/1 Knapsack Problem 2. (10 pts) What is the time complexity of your preudocode? Is it an eficient sizeithem? Can DP find the optimal solution? 3. (20 pts) Show the step-by-step iterations of the pseudocode on the instance with =4. W = 12 and the values us and volumes w, of item i are 1 1 2 3 4 w 3 2 8 6 U 2 4 3 5