3 Imagine we have a new programming language with identifiers that is made up from letter and digits But in an unusual way Draw a DFSA for identifiers that contain only one letter and at least one digit

a) where the identifier must have at least one letter, but it need not be the first character.

e.g. 1a, b2 1a2b3c would all be valid b) where the identifier must have at least one letter and there must be at least one digit before the leftmost letter. e.g. 1a, 1a2b, 1acb, 2a345b would all be valid