Implement a function that decides whether two arbitrarily nested sets are equal. Sets are unordered and contain no duplicates; an element may be an integer or another set. The inputs are given as nested arrays that represent these sets (for example, [1,[2,3],4] represents the set {1, {2,3}, 4}). Nesting depth is unbounded. Because sets are unordered, order within any array is irrelevant, and a repeated encoding of the same element (e.g. [1,1]) denotes the same single-element set. An integer is never equal to a set, even when the set wraps that integer ([1] is not equal to 1, and [[]] is not equal to []). Return true if the two inputs denote the same set, and false otherwise. Approach: canonicalize recursively. Map each integer to a tagged leaf and each array to the (order-independent, duplicate-collapsing) set of its canonicalized elements — a frozenset in Python. Two inputs are equal exactly when their canonical forms are equal. This is equivalent to recursive structural comparison and avoids the subtle bugs of naive index-by-index comparison. Alternatives include sorting a canonical key at each level (works but needs a total order over mixed int/set keys) or hashing; the frozenset approach gets both order-independence and duplicate-collapsing for free. Examples: - set1 = [1,[2,3],4], set2 = [1,[3,4],2] -> false (the inner sets {2,3} and {3,4} differ, and 2/4 don't reconcile at the top level) - set1 = [1,[2,3],4], set2 = [1,4,[2,3]] -> true (same elements, different order)