Consider the problem of determining if a string is a number in the following format: an optional minus sign followed by at least one digit, or an optional minus sign followed by any number of digits, a decimal point and at least one digit. Design a finite automaton for this problem. Use the label other to indicate input, which is not a digit or a minus sign, and any for all input, including a digit or a minus sign. Label your DFA properly, i.e., each node should have a label; clearly indicate the start and accepting states; each arc should have a label and a direction