Can someone help me please

Construct a DFSA to accept each of the following languages. 1. {baa, ab, abb} 2. {xe {a,b}* x does not end with ba? 3. {xe {a,b}* | x contains both aa and bb as substrings 4. {xe {a,b}* | x has neither aa nor bb as a substring} 5. {xe {0,1}* | 1st symbol of x # the last symbol} 6. ? = {a,b), all strings of even length and end with an a 7. {xe {0,1}* x is the binary representation of an integer beginning with a 'l' and divisible by 5