This problem is for a discrete structures course, i am not certain if it wants pseudo code, or if it wants a written explanation of the algorithm, i am counting on whoever answers to read what is provided and provide the corresponding algorithm and the complexity level in big o notation of said algorithm and how it was found.
Suppose we have a collection of n different subsets of the set { 1, 2, ..., n } and they are in some arbitrary order, that is, we have subsets s1, s2, ..., sn, but how many and which elements are in each of these subsets is entirely arbitrary. Suppose also that we have another subset s' of { 1, 2, ..., n }.
(a) Express a brute-force algorithm that determines whether s' equal to one of the subsets in the collection.
(b) Give a big-o worst case estimate as a function of n for the time complexity of your algorithm. To receive full credit, you must explain how you obtained your answer.