Given an integer array `nums` that may contain duplicates, return all possible **unique** subsets (the power set). The result must not contain duplicate subsets.
Each subset is returned in non-decreasing order, and the list of subsets is ordered with each subset's elements ascending and subsets compared lexicographically.