We are given sets S1, S2, . . . , Sn, each of which is a subset of {1, 2, . . . , n}, and we want to know whether there are any pairs of sets that are disjoint ( sets that have no elements in common). You can assume that each set Si is represented in such a way that we can check in constant time (O(1)) whether a given element x belongs to Si . Write brute force pseudo-code in English sentences to solve this problem. What is the asymptotic runtime of your algorithm