For the set E = {0, 1, 2}, compute the power set 2^E. How many elements does this set have? Given the following finite language L = {aaa, bbb} over the alphabet sigma = {a, b} (a) Draw a Finite State Automaton (FSA) that recognizes this language. (b) Explicitly write down all the transition functions. (c) Draw a FSA that recognizes the language L^2. Given the alphabet sigma = {a, b} and the following language L = {a^nb |n elementof N} (a) Draw a Finite State Automaton. (b) Write all the transition functions. (c) How many elements are in this language? (d) Draw a FSA for the language L^R (Remember L^R = {w^R|w elementof L})