Give DFA's accepting the following languages over the alphabet {0,1}. The set of all strings that, when interpreted as a binary integer, is a multiple of 5. For example, strings 101,1010, and 1111 are in the language; 0,100,and 111 are not. Construct the DFA for that problem! Explain your answer in detail.