(a) State the decision version of the 0 1 knapsack problem. (b) Describe how the solution to the previous problem (the dynamic programming solution to the optimization algorithm for the 0 1 knapsack problem) could be used to solve the decision version of the 0 - 1 knapsack problem. What is the time complexity of your algorithm that solves the decision problem? (c) Is the dynamic programming solution to the 0-1 knapsack problem a polynomial time algorithm? You should assume that we are talking about the decision version of the 0-1 knapsack problem. Explain your answer. (a) State the decision version of the 0 1 knapsack problem. (b) Describe how the solution to the previous problem (the dynamic programming solution to the optimization algorithm for the 0 1 knapsack problem) could be used to solve the decision version of the 0 - 1 knapsack problem. What is the time complexity of your algorithm that solves the decision problem? (c) Is the dynamic programming solution to the 0-1 knapsack problem a polynomial time algorithm? You should assume that we are talking about the decision version of the 0-1 knapsack problem. Explain your