Need help with these questions about Deterministic Finite Automata

1. Show that the DFA in Figure 2-9 is minimal. 0 10 100 10 11 101 0 d111 110 0 Figure 29: A DFA that accepts strings with a 1 in the third-to-last position 2. Minimize the DFA defined by the transition function below. The accepting states are {93, 94, 98,99}. = 8(90, a) = 91,8(90;b) = 49 8(91, a) = 98,8(91,6) = 42 8(92, a) = 43,892,0) = 42 8(93, a) = 42,8(93,6) = 44 8(94, a) = 95, 8(94,b) = 48 8(95, a) = 94, 8(95, b) = 45 8(96, a) = 97,8(96, b) = 45 8(97, a) = 96,8(97, b) = 45 8(98, a) = 21,8(48,6) = 43 8(99, 2) = 47,8(49,b) = 48 = 3. Find a minimal DFA for the following NFA. 80 0,1 0,1 90 91