Pumping lemma E = {a,b}

b) Consider the following nonregular language B. B-r( w I w contains more b's than a's } Assume B is regular. Let p be the pumping length given by the pumping Lemma. (1) Can we use string s daa as a counter example to bring a contradiction? (Yes/No) (2) Can we use string s - ababbas a counter example to bring a contradiction? (Yes/No) satisfying the three conditions