1. Consider a language L such that each sequence in it consists of 2 parts. The first part is a sequence of symbols drawn from the set {a,b}. The second part is a sequence of symbols drawn from the set {c,d}. The two sequences are of the same length. So some possible members of L are: abcd badd bbabcdcd Use the Pumping Lemma to give an argument that L cannot be defined by an FSA ANSWER not visible yet 2. Consider a language L={(ab)nicnn>0}. This means each member L begins with a sequence of n repeats of the ab, which is then followed by i, which is then followed by a sequence of n repeats of c. Use the Pumping Lemma to give an argument that L cannot be defined by an FSA