(3) Design a deterministic finite automaton with alphabet {0, 1} that recognizes the language of positive binary integers that are multiples of 5. It is your choice whether to allow leading 0s in the numbersyou must state your choice clearly. Then show how you would modify your machine if the digit 2 is added to the alphabet and numbers are base 3. Draw the new diagram.

please answer it in detail.