123) In the figure given below, a deterministic finite automation M has start state A and accepting state D. Which of the following regular expression denoted the set of all words accepted by M?

124) The regular sets are closed under

125) Dynamic errors can be detected at

126) If a and b be the regular expressions, then( a* ∪ b* ) * is equivalent to

127) Finite state machines _________ recognize palindromes