1. Non-regular languages and the Pumping Lemma Let S = {0,1,2,3,4,5,6,7,8,9, +, = } and consider the language L of all strings over that constitute a valid and correct equation of the form a + b = c where a,b,c are non-negative integers represented in base 10, without leading zeros. Some elements of L include 13 + 17 = 30 and 99 +0 = 99, but not 13 + 17 = 29 (wrong arithmetic) or 99+01 - 100 (leading zero in the number 1). Use the Pumping Lemma to prove that L is not regular