*Please help Pumping Lemma problems 1 to 4. Thank you!

For each of the following languages, either show that it is regular by giving a RE for the language or show it is not regular by using the pumping lemma. Assume the alphabet = {0, 1} for all of the following problems:

(1) {0'110i, j>0} (2) {0111i | i, j>0} (3) {uvuu, v 5*} (be careful about what words are in this language) (4) {u0v | U, VE * and (u) = \vl} (i.e. U and v have the same length)