Solve the F question..

Humber (e.g the given RegEx to an equivalent NFA: h a O in its firb umbber 38 (0+11+10+ 00)*01) lowed by a peri 39, ((a + b + cer(a + b + c + ) 40, (a + b + c) *c(a + b)c(a + b)(c + )" umber orr Of Convert the given deterministic finite automaton (DFA)on-deterministic finite automaton 41. DFA shown in Fig. 2.5 for even binary numbers without leadings 0s 43. NFA shown in Fig. 3.5 to search for a keyword. last name are al bue withNFA) to an equivalent RegEx. gits, then 70,439,444.49 are / E 70,430n com4.DFA shown in Fig. 2.12 for same symbols in all odd positions. nutes in the tD . NFA shown in Fig. 3.9 for certain binary strings. latitudes and E a45. NFA shown in Fig. 3.11 for binary numbers divisible by either 4 or 6. to 90 andlonge46 46. DFA shown in Fig. 3.15 for strings with 0, 1 and 2 in that order. N 77 66.5843E 47. (0 + )(I l *O) * (1+1) and (1+1)(011*) *(0+) 48. (0*1*)*and (0+1)* 49 (1 + ) (00 * I ) * 0 * and (0+) (11*01* 50. (0+1) *(0+) and (I+A)(1+0) * (0+1+1) G. Are the following pairs of RegEx's equivalent (i.e,do they represent the same set of strings) a with no closure) represe