Question: Exercise describes a method that returns all the sums that can be formed from a collection of items. Implement method getOriginalItems, which takes as parameter a List representing all the sums and returns back the original input. For instance if the parameter to getOriginalItems is [ 0, 3, 4, 7, 7, 10, 11, 13 ], then the return value is a list containing [ 3, 4, 7 ]. You may assume that there are no negative items in the output (and thus the input).
Exercise: Method allSums returns a List containing all the possible sums that can be formed by using any of the items in the input array at most once. For instance, if the input contains 3, 4, 7, then allSums returns [ 0, 3, 4, 7, 7, 10, 11, 13 ]. Note that the items do not have to be returned in any particular order, but also note that if a sum can be produced multiple ways, it has to be listed multiple times. Implement allSums recursively. If the input has N items, what is the size of the returned list?