Given = {0,1}, write a formal definition and draw a state diagram of a DFA recognizing the following language:

L4 = {w| w begins with 00 and ends with 1}