3. Suppose you are given a set of positive integers A= a positive integer B. A subset S C A is called feasible numbers in S does not exceed B: lai, a2, feasible if the sum of an , ai B ajes The sum of the numbers in S will be called the total sum of s. You would like to select a feasible subset S of A whose total sum as large as possible. Example. If A-8, 24) and B = 11, then the optimal solution is the subs S (8, 2). (a) Here is an algorithm for this problem. Initially S= Define T=0 For i=1,2, ,n