Let Σ={a,b}. For the languages that are defined by the grammar S→aSa∣bSb∣a∣b do the following:
(i) List five strings of a's and b's of length 5 or 6 that are in L.
(ii) List five strings of a's and b's of length 5 or 6 that are not in L.
(iii) Describe L formally and concisely.
(iv) Describe L in plain English, as plain as possible. (v) (Extra: 5pts) Indicate whether or not L is regular. Prove your answer.