2. Let the universe U = {q, w, e, r, t, y, u, i, o, p} and let G = {q, w, r, t, y, u, i} and H = {w, r, y, i, p). Give the bit string representation for the following expressions. In your representations, assume that the sequence for the elements is q, W, e, r, t, y, u, i, o, p>. a) G b) H d) GUH e) G-(H) In addition, answer the following questions f What is the big-Oh complexity of about the implementation. implementing set intersection if it is navely implemented by iterating over two unordered membership lists of different sizes (not using the bit-wise operators) g) What is the big-Oh complexity of implementing set intersection if it is implemented using bit-wise operators