Please help me solve! I will upvote, Thank you!

Ex.4 (Collecting Stamps) We have collected n stamps s1,s2,,sn each associated with a different positive integer value v1,v2,,vn. We want to determine if there is a subset of the stamps whose total sum of values is equal to a given integer V amount of dollars. (Hint: we saw similar problems in class, like the Knapsack and Coin Changing problems.) For example, if we have n=5 stamps with values v1=5,v2=6,v3= 18,v4=45,v5=79 and we want to create the total sum V=90, the answer is YES since v1+v2+v5=5+6+79=90, so taking the first, second, and fifth stamp will do the job. - Design a dynamic programming algorithm that runs in time O(nV) and answers the question. - Moreover, design a reconstruction algorithm that outputs the subset of the stamps whose total sum of values equals V