Given an array of integers, find the subset of non-adjacent elements with the maximum sum. Calculate the sum of that subset. It is possible that the maximum sum is , the case when all elements are negative.
The following subsets with more than element exist. These exclude the empty subset and single element subsets which are also valid.