#Problem Statement: Given an array print all the sum of the subset generated from it, in the increasing order. # Time Complexity: 2^n Subsets for every n and doing sum => O(n.2^n) + Sorting ...

Given a list arr of N integers, print the sums of all subsets in it. When no element is taken, the sum is 0. When only 2 is taken, the sum is 2. When only 3 is taken, the sum is 3. When elements 2 and ...