Please help find s1 to s8

Question 7 0/4 pts Use the construction given in Theorem 1.39 to convert the following two nondeterministic finite automata to equivalent deterministic finite automata. Note. You need to draw the state diagram of the DFA in HW3.2. Choose the next states in the DFA transition table. Hints: see EXAMPLE 1.41 in the textbook. 0,1 DA DFA Transition Table state 0 1 Accept {A} {A,C) 0 {B} {A,B) {C} {B} {B.C) {A.C) s1 55 {A,B) s2 s6 {A,B,C) s3 57 Question 11 7/12 pts Convert the following NFA to DFA by building the transition table below. NA NFA to DFA Transition Table Accept State 1 ISI s1 0 SA SB B 0 54 0 ED S.B) 55 s10 ISACI 56 s11 AD 57 512 0 11 0 s1 52 D] 53 ,B) 54 55 S.AC) s6 {AD 57 (D