Given an integer array nums, that can contain duplicate elements,  return all possible subsets while ensuring that each subset is unique. The output must include unique subsets, and you may return them in any order.

Constraints:

• $1 <=$ nums.length $<= 10$

• $-10 <=$ nums[i] $<= 10$ ...