Purpose: To model a DFA $($Deterministic Finite Automaton$)$ and use it to accept strings of the

associated language.

Input: The program should take the DFA description from a text file that is specified as a

command line parameter. If this parameter is missing, the user should be prompted for the data

file. Strings to be tested for inclusion in the language should be entered interactively by the user.

Output: For each string being tested, the program should indicate whether or not the string is

accepted. $\{0,1\}$

$\{a,b,c,d\}$

$a$

$\{d\}$

$(a,0)b$

$(a,1)a$

$(b,0)c$

$(b,1)a$

$(c,0)c$

$(c,1)d$

$(d,0)d$

$(d,1)d$ this is the sample we got provide Assume no spaces in input.

Alphabet must at least allow $\{0,1\}.$ Please feel free to expand this.

States must at least allow letters, but you are welcome to expand this.

Transition functions may appear in any order in the input text file. End of the input file

indicates the end of transition functions.

You can team up with up to $2$ other students in class or do the project individually. Full

participation of each member in a team is expected.

The sample DFA$-$Test.txt file is given in folio to describe the DFA in Example $2$ of

the chapter$5$ slides, page $13.$ It is a DFA that recognizes the regular language over $\{0,1\}$

that contain the substring $001.$ You can use this as your first sample test file. But you are

required to submit a different DFA and make sure that your own DFA input file fits

the format in the project description. all source code files

a sample DFA text file of your own

PowerPoint slides of your presentation that

gives an overall project description;

shows your own DFA sample file $($different from the DFA input sample from

me$),$ illustrate the state diagram of your DFA, and explain the regular language that

your DFA is supposed to accept;

includes screenshots of the execution results to show least one string to be accepted

and at least one string to be rejected.

You must have screenshots that demonstrate your program execution that is

based on the different DFA input than the sample. please make the code in java, javascript,or python,