use pumping lemma to prove

if it is finite, it is a regular language

1. Prove L {a"(baa)m:n 20, m 1} is regular using three different methods. Justify your answers