Q3 [Difficulty: Easy] Convert the following NFA to DFA and informally describe the language it accepts. [3 points] * 8 90 91 92 93 * 94 0 1 90, 91}{90} {92, 93} {94} {90, 92} {94} Q4 [Difficulty: Easy] Construct a DFA that accepts binary strings if and only if the binary string when viewed as the binary representation of an integer is a multiple of five. Use the leftmost symbol as the most significant bit, and the rightmost as the least, e.g., 0110 and 00110 both correspond to 6, whereas 01100 corresponds to 12. (Note: The DFA need not be optimal in size.) [2 points] Hint: Think how the remainder evolves as each symbol is read. Use states to represent remainders.