Help, I need further explanation and clarification for the following question (please showcase the steps taken):

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

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

(b) {, 1}