A) If language L1 is regular and language L2 is non-regular, then language L1 + L2 is non-regular. b) If language L1 is non-regular and language L2 is non-regular, then language L1 Intersection L2 is always non-regular. c) There exists an algorithm to determine whether two finite state automata are equivalent. d) The language consisting of twice as many a's as b's is regular. e) For any nondeterministic finite state automaton, there is an equivalent deterministic finite state automaton