Please use Automata, the circle thing

7. Construct an automaton that recognizes the set of all strings over the alpha- bet fa, b) that do not begin with ab or bb, but end in ab or bb. 8. Construct a shift machine having input and output 0, 1) such that any input (binary) string ziT2 Fn s output as 1z2 Fn. Is it possible to construct a similar machine (having the same input and output symbols as the shift machine), but outputs zi0r20. ..rn0 when riT2 zn ls input? Explain your