2. Consider the following items with their corresponding weights and values. Item Weight Value 20 15 10 35 45 Ai Assume you need to carry the items by a truck which can carry at most W-8 tons and only one trip is allowed. a. Set up a recurrence relation for this problem to find the optimal solution. b. Find the best solution by creating dynamic programming table. c. What is the time complexity of the dynamic programming algorithm if you have n items and W capacity? Please explain