Chapter 3.3, Problem 11E

pose we havensubsets $S_1$, $S_2$, ..., $S_n$of the set {1, 2, ...,n}. Express a brute-force algorithm that determines whether there is a disjoint pair of these subsets. [Hint: The algorithm should loop through the subsets; for each subset $S_i$, it should then loop through all other subsets; and for each of these other subsets $S_j$, it should loop through all elementskin $S_i$to determine whetherkalso belongs to $S_j$.]

1. Give a big-Oestimate for the number of times the algorithm needs to determine whether an integer is in one of the subsets.