Problem 1 Consider the deterministic finite automaton shown in Figure . startSQ, Qs 1 Q2 Figure 1: Deterministic finite automaton for Problem 1 Define a Java program DFACheck which accepts the name of a file on the command line, and for every string in the file outputs both the string itself, and whether or not it is accepted by the deterministic finite automaton shown in Figure You may assume that the file contains a single string per line, and that the only delimiter is the newline ' ' character