Solve the G question..

vert the given deterministic tinite automaton (DAy non-deterministic finite automaton (NFA) to an equivalent RegEx y a with an e digits, then 41. 42. DFA shown in Fig. 2.12 for same symbols in all odd positions. 43. NFA shown in Fig. 3.5 to search for a keyword. 44. NFA shown in Fig. 3.9 for certain binary strings. 45. NFA shown in Fig. 3.11 for binary numbers divisible by either 4 or 6 46. DFA shown in Fig. 3.15 for strings with 0, 1 and 2 in that order. DFA shown in Fig. 2.5 for even binary numbers without leadings 0s. 1.670.439,444 minutes in the for latitudes and om 0 to 90 and 47. (0 + )(11*0) * (I + ) and (1+1)(011*) * (0 + ) 48. (0*1) and (0+1)* 49. (1 + )(00 * 1)*0* and (0 + ) (11"OI* 50. (0+1)*(0 + ) and (1+1)(1 +0)*(0 + 1 + ) le. G. Are the following pairs of RegEx's equivalent (i.e, do they represent the same set of strings)? 51. Can a RegEx with only union and concatenation operators (i.e., with no * closure) represent an infinite number of strings? Explain