(a) Design and draw a DFA which reads in a non-negative integer written in binary, least significant bit first, and accepts exactly when the input is divisible by four. (There is no sign bit in the representation.) Specify what Q, , , q0, and F are for your DFA

(b) Now suppose that before the least significant bit, there is a bit indicating the sign of the integer: 0 for a negative number, and 1 for a positive number. How would you modify your DFA to handle these signed integers?