$!$ Exercise $2\mathrm{.}2\mathrm{.}5$: Give DFA's accepting the following languages over the alpha$-$ bet $\{0,1\}$; $54$ CHAPTER $2.$ FINITE AUTOMATA c$)$ The set of strings that either begin or end $($or both$)$ with $01.$ d$)$ The set of strings such that the number of O$\text{'}$s is divisible by five, and the number of $1\text{'}$s is divisible by $3.$