Give state diagrams of DFAs recognizing the following languages. In all parts, ={0,1}. The empty set b. {w | the digits interpreted in binary are...

3. Give state diagrams of DFAs recognizing the following languages. In all parts, Σ ={0,1}.

a. The empty set

b. {w | the digits interpreted in binary are evaluated to 8 or higher}

c. {w | w has an even number of digits}

d. {w | the digits together sum to a number less than 3 }