However, this does not differentiate between the following three scenarios:Two stores are equal if both contain the same elements; the order of the elements in the Store is irrelevant. You can use contains and foreach for this implemen- tation.
A -> (1,1,2)
B -> (1,2,1)
C -> (1,2,2)
Should our implementation of equals hold true for \(A = B = C\) ? Or does 'contains the same elements' only refer to permutations of the same list, i.e., \(A = B\) , but \(A \neq C\) ?