Hello guys. I’m having problems with these DFAs.

So the following language only accepts alphabet {0,1}.

And the language is the set of strings that either begin or end [or both] with 101.

Another DFA construction for the set of strings such that the number of 0’s is divisible by five, and the number of 1’s is divisible by seven.

Need the state diagram.

Any help? Thanks.