1)construct a derministic finite automaton 2)what are the properties of transition functions.

Let Q = {go 9. 93 9). Then the deterministic automaton M, equivalent to M is given by M = (20 [a, bl. a [gol. 5) where F consists of: [93] [90. g.]. [41-931 19. 91). 190. 91. g:). [4.- q:- 31. t. 42. 43] and Lgo. 4: 42 gal and where 5 is defined by the state table given by Table 3.7. Page 10 CS345 Finite Automaton Monday, 14 December 2020 TABLE 3.7. State Table at M for Example 3.8 Salam 6 @ 0:1 I al 1992 10 0:2 00: 10 :1 I a. :) 14. 9.] 1999