Determine equality of arbitrarily nested sets

Implement a function that determines whether two arbitrarily nested sets are equal. Sets are unordered and contain no duplicates; elements can be integers or other sets. Inputs are given as nested arrays representing sets (e.g., [1,[2,3],4]). Your solution must handle unlimited nesting depth. Choose and justify suitable data structures, describe the algorithm, and analyze time/space complexity. Include unit tests for the following cases: set1=[1,[2,3],4], set2=[1,[3,4],2] -> false; set1=[1,[2,3],4], set2=[1,4,[2,3]] -> true. Discuss trade-offs such as canonicalization vs. hashing vs. recursion with memoization, and cover edge cases (empty sets, duplicates in input encoding, very deep nesting).