Please only answer the second question.

Alphabet = {0,1}. (a) are the following languages regular or non-regular? (b) if your answer is regular, please provide either a DFA, NFA or regular expression (choose only one) that recognizes the language. If your answer is non-regular, please prove it by contradiction via Pumping Lemma. 1. X = { 01 m, n >0} 2. Y = {rrrer* and | | > 1}