Build a deterministic finite automaton (DFA) that accepts the language {w{0,1}:w begins with 1 and, when interpreted as a binary number, is a multiple of 5} In this question, you will only draw a state diagram. Label your states intelligently to suggest their semantics, and lay it out intelligently to make it a planar graph (no edges crossing). Since I am not asking for a file format answer in this question, please be particularly clear with your diagram