Just (f) and (h) please. Thank you

1. Given ={0,1}, write a formal definition and draw a state diagram of a DFA recognizing the following language (: optional): (a) L0={ww=4} (b) L1={ww4} (c) L2={ww contains 010} (d) L3={ww doesn't contain 010 } (e) L3={w every even position of w is a 0} (f) L4={ww begins with 00 and ends with 1} (g) L5={ww=} (h) {,1} (i)