Given an array of integers, nums, find all possible subsets of nums, including the empty set.

Note: The solution set must not contain duplicate subsets. You can return the solution in any order.

Constraints:

• $1 \leq$ nums.length $\leq 10$
• $-10 \leq$ nums[i] $\leq 10$
• All the numbers of nums are unique.