input: Write a python function to get unique subsets from a list of integers.
  assert sorted(get_unique_subsets([1, 2, 2])) == sorted([(), (1,), (2,), (1, 2), (2, 2), (1, 2, 2)])
  assert sorted(get_unique_subsets([1, 2, 3])) == sorted([(), (1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)])
  assert sorted(get_unique_subsets([1])) == sorted([(), (1,)])
output: def get_unique_subsets(nums):
      from itertools import chain, combinations
      
      def all_subsets(iterable):
          s = list(iterable)
          return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))
      
      return list(set(all_subsets(nums)))