1. A set S contains n elements. How many possible subsets can be formed from S (including S and the empty set o)? (Hint: you might want to try a set with n= 0 elements and count the total number of subsets that could be formed. Then try n = 1, n = 2, n = 3 until you see a pattern start to develop.) 2. Let S = {a,b}. Let u= a3bab3 and v = bab be strings in . Compute the following (a) uv and uul. (b) vu and (vul. (c) eu. (d) veu. (e) uev