a) Suppose we have n subsets S1, S2, . . . , Sn of the set {1,

Question:

a) Suppose we have n subsets S1, S2, . . . , Sn of the set {1, 2, . . . , n}. Express a brute-force algorithm that determines whether there is a disjoint pair of these subsets.
b) Give a big-O estimate for the number of times the algorithm needs to determine whether an integer is in one of the subsets.