Given two sets A and B represented as sorted sequences,

1. Given two sets A and B represented as sorted sequences, describe an efficient algorithm for computing A⊕B, which is the set of elements that are in A or B, but not in both.

2. Suppose that we represent sets with balanced search trees. Describe and analyze algorithms for each of the functions in the set ADT, assuming that one of the two sets is much smaller than the other