input: Write a python function to find all unique combinations of sublists from a given list.
  assert find_unique_combos([1, 2, 3, 4]) == [(1,), (2,), (3,), (4,), (1, 2), (1, 2, 3), (1, 2, 3, 4), (2, 3), (2, 3, 4), (3, 4), (1, 3), (1, 3, 4), (2, 4)]
  assert find_unique_combos([1, 2, 2]) == [(1,), (2,), (1, 2), (1, 2, 2), (2, 2)]
  assert find_unique_combos([]) == []
output: def find_unique_combos(lst):
      from itertools import combinations
  
      result = set()
      for i in range(1, len(lst) + 1):
          for combo in combinations(lst, i):
              result.add(combo)
              
      return sorted(result, key=lambda x: (len(x), x))