9 a Find the state table for the finite state machine in Fig 6 8 where I 0 0 1 Start 1 0 So 0 0 51 1 1 0 1 SA 1 0 0 0 52 0 0 1 0 S5 0 0 1 0 0 0 1 0 Figure 6 8 b Let x J with x 4 If 1 is a suffix of w so x what are the possibilities for the string x c Let A 0 1 be the language where w so x has 1 as a suffix for all x in A Determine A d Find the language A 0 1 where w so x has 111 as a suffix for all r in 4