*6. Find a Markov algorithm that accepts
L= {a n b m a nm : n ≥ 1, m ≥ 1}.
7. Find an L-system that generates L(aa*).
8. What is the set of strings generated by the L-system with productions
a → a,
a → aa,
when started with the string a?