2. (30 points) The alphabet is {a, b. Give a B-NFA for the following languages (a) (15 points) w E a, by w has an infinite number of a's h (b) (15 points) w E fa, b) w has a finite number of a's y (c) (0 points) Think about: For the above languages ponder if they could be done by a B-DFA which is a DFA where we say an infinite string accepts if it hits some final state infinitely often