4. A set of natural numbers is given: SCA Sub group The optimal solution is: S = {8,2} Laies ai B We will need to find a max sub group who is valid, max sub group valid, is a group that the sum of the elements is the maximum as posibble. Example: ,B=11,A = {8,2,4} Proximity algorithm for the problem: Initially S = Define T = 0 For i = 1, 2,..., n If T+ a B then Endif an}, is called valid, if If the sum of the elements is not greater than B: Endfor 1 A = {a a. *** Opt T S-SU {a} T+T+a and a natural number B. A. Please provide example (Group A and Group B), For whom the algorithm return group S, that the sum of the elements (T), is less then half of the optimistic solution: >2 .p(n) > 2 it means => B. Build a Proximity algorithm who solve the problem in complicity of O(nlogn). With: .p(n) 2, please prove that the solution is satisfying those requirements.