L={w{a, b}*:w contains no more than one b}. L is accepted by the following DFSM M:

We can simulate M by the following program:

While (true)

{

S: c= read char()

If( c== EOF) print yes;

else if ( c== a) go to S;

else if (c==b) go to T

T: c= read char()

If( c== EOF) print yes

else if ( c== a) go to T

else if (c==b) print no

}

This above note is just an english version of the java code. I need a java code that runs L using the above while loop. look at the picture posted for more information as to how to continue the code.

1. Write a Java program to read in a DSFM, then decides if an input string is accepted by the DSFM or not. You can assume the input DSFM is legal, and states are named with single letters. Note . The program has 2 parts: l. Read in the start tate, the final states, and the transitions of the input DSFM. (no need to read| K or since the transitions would imply those) -Use a Vector String to store the set of final states. . Use a Vector to store the set of tansitions. 2. Determine if an input string is accepted or rejected based on algorithm dfsnSimulate. String methods such as sta With, and substring are useful . The following run is for the DSFM deseribed in Ex2-4-1: nter final states, 1 on each line. Enter to end; nter trons itions, 1 *nach line with no ws 1 state, letter,state. Enter 0,8,0 to end: b.t nter input string. enter done to endia nter input string, enter done to end:ab ccept er input string, nter, dare to nd:ahb eject nter input string. enter done to end:aba ccept nter input string, enter done to erd :abda ccept nter input string. enter done to end:abbb nter input string, enter done to end:b ccept er input #tring, enter done to end:hb eject