Find all Unique Subsets of a given Set
Given an array A[] of positive integers, print all the unique non-empty subsets of the array Note: The set can not contain duplicate elements, so any repeated subset should be considered only once in the output. Examples: Input: A[] = {1, 5, 6}Output: {{1}, {1, 5}, {1, 6}, {5}, {5, 6}, {6}, {1, 5,