[24] Draw a DFSA that recognizes all strings that are odd binary integers with the following conditions: there are no leading zeroes and each string is terminated by the character 'S'. For example, your DFSA should recognize 11001$, and 1001$ but not 0101$ or 1010$. a. Start by writing a regular expression that describes the strings described above. b. Draw the DFSA corresponding to your regexp. c. Show the steps that would be taken to recognize (or not) the following strings: i. 1010108 ii. 10015