please need all answers will rate well

6. [15] Draw a DFSA that recognizes all strin gs that are even binary numbers. You can assume eaclh string is terminated by the character 'S' and that there are no leading zeroes. For example, your DFSA should recognize 10010S, and 1010S but not 010S or 101s. [10 points) Describe or list all strings that will be matched by the following regular expressions. a. f(or)*tl.* b. xy*z