Please solve as soon as possible. I am running out of time. I will thumb up:

A Wrong Grammar (2 points) 2.0 points possible (graded, results hidden) Consider the following context-free language. L1 = {w {a,b}* : w contains an equal number of as and bs} Your friend comes up with the following grammar for L1. | | Unfortunately, his grammar is wrong! Find a length 6 string s L that is not generated by the grammar above. There are many possible correct answers. Writing down any of them will work