PLEASE ANSWER ONLY IF YOU KNOW

SUBJECT IS THEORETICAL COMPUTER SCIENCE

Deterministic finite automata (DFA)

PLEASE SHOW WORK

A vending machine dispenses goods whenever at least a total of 1 dollar is deposited. The machine accepts only nickels, dimes, and quarters. Thus, given a sequence of coins, construct a DFA that accepts if the total of the sequence of coins sums to at least 1 dollar. Let ={n,d,q} where n,d, and q represent a nickel, a dime, and a quarter respectively. For instance, the input string w= dnddqqnnn will be accepted