Update README.md

Author: abhisheks008

Knapsack/0-1 Knapsack/Dynamic Method/README.md

@@ -65,7 +65,10 @@ we take maximum of (25, 40 + DP[2][6-3])
 = 65
 ```
 
-## ⏰ Complexity Analysis: 
+## 💻 Input and Output 
+![](https://github.com/abhisheks008/PyAlgo-Tree/blob/main/Knapsack/0-1%20Knapsack/Images/knapsack1.PNG)
+
+## ⏰ Complexity Analysis
 - **Time Complexity:** `O(N*W)`. [where ‘N’ is the number of weight element and ‘W’ is capacity. As for every weight element we traverse through all weight capacities 1<=w<=W.]
 - **Auxiliary Space :** `O(N*W)`. [The use of 2-D array of size `‘N*W’`.]