Question: A paragraph of English text is to be scanned and the number of words beginning with "con" counted. Design a finite-state machine that will output a 1 each time such a word is encountered. The output alphabet is 50, 16. The input alphabet is the 26 letters of the English alphabet, a finite number of punctuation symbols (period, comma, and so on), and a special character b for blank. To simplify your description, you may use I - 5m6, for example, to denote any input symbol not equal to m.