Consider the language over the alphabet {5,9} that includes all strings that begin with a sequence of m 5's followed by a sequence of 2m 9's, where m > 0.

For example, the strings 599, 559999 555999999 are in the language, but 59 and 5599 are not.

Can this language be recognized with an ordinary DFA (one that does not use a stack)?

If you answer yes, draw the description of the machine. If your answer is no, give an informal reasoning for your answer.