1. Write the following description are regular grammar and formal languages formula:
L1={abna|n≥0}：
S->aA
A->bA|a
L2={ambn|n≥1,m ≥1}：
S->aS
S->bS|ε
L3={（ab）n|n≥1}：
S->abS
S->ab|ε
2. Convert the following regular grammar to the regular formula
0A → Z
A → 0A | 0B
B → 1A | e
Z→U0|V1
U→Z1|1
V→Z0|0
S → aA
A → bA | aB | b
B → aA
I → l | The | A
