static int knapSack(int W, List<Integer> wt)
    {
        int n = wt.size();
        // Base Case
        if (n == 0 || W == 0)
            return 0;

        // If weight of the nth item is
        // more than Knapsack capacity W,
        // then this item cannot be included
        // in the optimal solution
        if (wt.get(n-1) > W)
            return knapSack(W, wt.subList(0,n-1));

            // Return the maximum of two cases:
            // (1) nth item included
            // (2) not included
        else
            return Math.max(wt.get(n-1) + knapSack(W - wt.get(n-1), wt.subList(0,n-1)),
                    knapSack(W,wt.subList(0,n-1))
            );
    }