Please explain

1. (10 points) Find a deterministic finite-state automaton that recognizes the lan- guage, L, consisting of all strings in fa, b)* that contain an odd number of b's such that there is at least one a between every two b's in the string. Submit the state-transition graph for your machine together with a non-trivial, sample run of your choosing. 2. (5 points) Construct a regular expression that generates the language, L, defined in