Alphabet 2={0,1} For ench provided langange (X and Y ), pleseat anawer these two questions (a) Is the language regular or non-rejular? (b) If your anawer bs rogular, please provide either a DEA, NFA of mgutar mopprsoilon (doocie only one) that roognizes the languige- If your arower is non-mgular, please prowe it by contradiction wodng Pamping Lemma. The presentation format of the proof Is teppectiof to follow those examples in the hook. 1. X={0m1nm+n is oven } Y={0m1nm+n