input: Write a function to solve the 0-1 knapsack problem using dynamic programming. The function should take in the capacity of the knapsack, a list of item values, a list of item weights, and the number of items, and return the maximum value that can be put in the knapsack without exceeding its capacity. If the capacity is 0 or the number of items is 0, the function should return 0.
  
  assert knapSack(50, [10, 20, 30], [60, 100, 120], 3)==220
  assert knapSack(0, [10, 20, 30], [60, 100, 120], 3)==0
  assert knapSack(50, [10, 20], [60, 100], 2)==160
  assert knapSack(50, [], [], 0)==0
  assert knapSack(30, [10, 20, 30], [60, 100, 120], 3)==160
output: 
  if capacity == 0 or n == 0:
      return 0
  
  dp = [[0 for _ in range(capacity + 1)] for _ in range(n + 1)]
  
  for i in range(1, n + 1):
      for w in range(1, capacity + 1):
          if weights[i-1] <= w:
              dp[i][w] = max(values[i-1] + dp[i-1][w-weights[i-1]], dp[i-1][w])
          else:
              dp[i][w] = dp[i-1][w]
  
  return dp[n][capacity]
  