Questions 60-61 refer to the following information. 60. Which of the following is the regular expression corresponding to the automaton above? (B)yx (C)xyx (D)xx (x+yly'x 61. Which of the following grammars over alphabet (x y1 generates the language recognized by above? (A) S xT (B) S xT (E) S xT T xTIT 02. Let d be a finite n n empty set with cardinality n. The number of subsets SSAhan goda sman y is (A) n (B) 2*2 (C) 201 (D) 2" (E) not determinable except in terms of whether n is even or odd