Consider a programming language where an identifier is defined as a sequence of uppercase

and lowercase letters, but starting with an uppercase letter; and an integer is defined as a

sequence of digits $(0,1,2,..\mathrm{.}9),$ but does not start with the digit $0.$

$1.$ Use EBNF to define the syntax for identifier and integer.

$2.$ Create a state diagram $($finite state machine$)$ to recognize identifier and integer.