Data Structures and Algorithms

Thank you!

Let A = {a1, a2, . . . , an} be a set of n positive integer and let T be mming algorithm that determines whether there another integer. Design a dynamic pr exists a subset of A whose total sum is eractly T. Analyze the time- and space-complerity of your solution. For instance, if A = {4,5, 17, 23,11,2) and T = 35 the algorithm should return TRUE because the subset 5, 17,11,2) sums to 35. For the same set of numbers if we choose T-31 the problem has no solution, and the algorithm will return FALSE