I am trying to solve the 0/1 Knapsack problem on GeeksforGeeks and it requires me to complete the funtion
int knapSack(int W, int wt[], int val[], int n)