Java knapsack problem using brute force algorithm.

Create a public method that prints all optimal solutions using a subset method that generates the kth subset of {0,...n-1} and 0<= k<=2^n -1and the kth subset is the binary respresentation of k using n bits.