Let = {a,b,c} and let L1 = {a,b,c,ab,ac} and let L2 be the language from part (d) in Question 1 above. For both L1 and L2: state whether that language satisfies the pumping lemma and, if possible, state a pumping length p for that language and give an example of a word in the language that is longer than p together with a valid decomposition into parts x, y and z (according to the pumping lemma and your choice of p). part d) question 1{w | |w| is divisible by m},where m= 9