Consider the following instance of the Subset Sum Problem: The weight limit W=5 and 3 items of weights w1=3,w2=2, and w3=4. Recall that we want to find a subset S of the items so that iSwiW and iSwi is as large as possible. Use the dynamic programming approach to find the value of the optimal subset (i.e., the sum of the weights of the items in the optimal subset). For this question, you do not have to find the optimal subset itself