Suppose you are packing for a backpacking trip and trying to decide which snacks to bring. your home pantry contains m snack items, each of which has a certain weight wi and a calorie value vi. your backpack can only hold a maximum weight of w , and for your journey you need a minimum of v calories. therefore, you need to answer the question: is there is some set s of items from your pantry such that the sum of the weights of the items in s is less than or equal to w , while the sum of the calorie values of the items in s is greater than or equal to v. required:
a. describe a (deterministic) algorithm for answering the question. is it a polynomial-time algorithm? explain your answer.
b. describe a non-deterministic algorithm for deciding the question. is it a nondeterministic polynomial-time algorithm?