Knapsack- Solving of Knapsack problem with different implementation 1 dimnsion (KP) with Dynamic Programming 2 dimension (KP) with Dynamic Programming 1 dimension (KP) with Branch and Bound method 1 dimension (KP) with Core Problem solving