Consider the Knapsack problem as discussed in class. You are given a set of items with a positive integer size and a positive value, and the goal is to find a sub-set of items to fill up a knapsack maximizing the total value. For this problem, you are given 2 knapsacks, each of a positive integer size K. Design an algorithm to find a subset of items to fill up the two knapsacks, maximizing the total value.