Prove or disprove that L1 and L2 are regular languages

a). Be L1 the language with the names of all students of the University of Hannover.

b). Be L2 be the language of all words that consist of only one letter, for example, L2 = {a, aa, aaa, ..., b, bb, bbb, ..., z, zz, zzz, ...}

--------------------------------------------------

Show that the following language meets the condition of the pumping lemma: L = {0^(m)1^(n) | m, n N0, m = 0 or n is a prime number}