Could some please answer the question below, it regarding Finite State Machines. Please see the image below.

Consider the problem of counting the number of words in a text file that may contain letters plus any of the following characters: ,.; Define a word to be a string of letters that is preceded by either the beginning of the file or some non-letter character and that is followed by some non-letter character For example, there are 11 words in the following text The cat saw the rat with a hat on the mat Describe a very simple finite-state machine that reads the characters in the file one at a time and solves the word-counting problem. Assume that there exists an output symbol with the property that, every time it is generated, an external counter gets incremented. (Hint: Take input symbols L (for letter), N (for a nonletter) and E (for end of-file). The output symbol A (for add one to the counter)