The Pumping Lemma for regular languages says: Every regular language L must satisfy the following condition. There exists an integer m such that for any w L with m, can be split intow-ryz with ryl S m, 21 such that for any i E (0UN, xy'z E L Question 1: If you want to show that L does not satisfy the Pumping lemma, you need to show that L satisfies the negation of the statement. Describe the negation of the Pumping lemma Question 2: Consider the statement "L satisfies the Pumping lemma L is regular". We know this is not necessarily true by logic. In order to refute1 the statement, what logical steps do you need to establish? You just need to describe the logical steps, i.e. what to do in order to refute the statement. The