Question: You have an account at First National Usury Trust (FNUT) and a card to operate their ATM (automated teller machine). Once you have inserted your card, the ATM will allow you to process a transaction only if you enter your correct code number, which is 417. Draw the state graph for a finite-state machine designed to recognize this code number. The output alphabet should have three symbols: "bingo" (correct code), "wait" (correct code so far), and "dead" (incorrect code). The input alphabet is 50, 1, 2, ... , 96. To simplify notation, you may designate an arc by I-536, for example, meaning that the machine will take this path for an input symbol that is any digit except 3. (At FNUT, you get only one chance to enter the code correctly.)