input: 
  def knapSack(W: int, wt: List[int], val: List[int], n: int) -> int:
      """
      Given a list of item values and weights, and a maximum capacity, find the optimal solution to the 0-1 Knapsack problem using dynamic programming.
      >>> knapSack(50, [10, 20, 30], [60, 100, 120], 3)
      220
      """
  
output:     
      dp = [[0 for _ in range(W + 1)] for _ in range(n + 1)]
      
      for i in range(1, n + 1):
          for w in range(1, W + 1):
              if wt[i-1] <= w:
                  dp[i][w] = max(val[i-1] + dp[i-1][w-wt[i-1]], dp[i-1][w])
              else:
                  dp[i][w] = dp[i-1][w]
      
      return dp[n][W]
  