Create a deterministic finite automaton in java with this format: The first three sequences should be accepted and the last two sequences show be rejected.

Recall that a string w is accepted by a DFA M, if and only if there exists a path from the start state of M to some final state in M labeled by the constituent characters of w. In this assignment you will implement a program in Java which will accepts as its input the name of a file containing a list of strings and will determine whether or not they are accepted by a specific automaton. Specification Define a program called DFACheckBasic which will accept as its input the name of a file containing a collection of strings and determines which of them are accepted by the deterministic finite automaton, M, shown in the figure below. start A {0,1} Input File Specification For this assignment you may assume that the input file is formatted with exactly one string per line and that the strings are guaranteed to be formed from characters of the input alphabet {0, 1}. As an example, the following is one possible input file: 1 100100 2 111 3 00100100 4 10101 5 01010101