Show each of these languages is regular by designing a deterministic finite automaton

that recognizes it$.$ All languages are over the alphabet $\backslash$Sigma $=\{0,1\}.$

a$)$ L$1=\{$w in $\backslash$Sigma $|$w ends with $1\}$

b$)$ L$2=\{$w in $\backslash$Sigma $|$w starts and ends with the same symbol$\}$

c$)$ L$3=\{$w in $\backslash$Sigma $|$w contains at least five $1$s$\}$

d$)$ L$4=\{$w in $\backslash$Sigma $|$w contains at most four $0$s$\}$

e$)$ L$5=\{$w in $\backslash$Sigma $|$ the length of w is odd $\}$

f$)$ L$6=\{$w in $\backslash$Sigma $|$ the number of $1$s in w is not divisible by $5\}$

g$)$ L$7=\{$w in $\backslash$Sigma $|$w ends with the substring $110$ or $11\}$

h$)$ L$8=\{$w in $\backslash$Sigma $|$w contains the substring $1001\}$

i$)$ L$9=\{$w in $\backslash$Sigma $|$w does not contain the substring $0011\}$

j$)$ L$10=\{$w in $\backslash$Sigma $|$w has at least four $1$s and an even number of $0$s$\}$