input: 
  def knapSack(W, wt, val, n):
      """
      Finds the maximum value that can be put in a knapsack of given capacity using dynamic programming.
      
      >>> knapSack(50, [10, 20, 30], [60, 100, 120], 3)
      220
      >>> knapSack(10, [5, 4, 6, 3], [10, 40, 30, 50], 4)
      90
      """
  
output:     
      dp = [[0 for _ in range(W + 1)] for _ in range(n + 1)]
      
      for i in range(n + 1):
          for w in range(W + 1):
              if i == 0 or w == 0:
                  dp[i][w] = 0
              elif 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]
  