[40pts] Problem #5 Write a grammar for the language L = { ap-sbPQ s r). write necessary constraints to make your grammar consistent. Assume s> q [5pts] () Write at least 4 members of L. 5pts] (ii) Define a new "counting" variable considering that s >q [5pts] (ii) Verify/prove that r -qis positive [5pts] (iv) Re-write L using the new variable defined in step (ii) [5pts] (v) Prepare the expression for L showing explicitly its terms before writing its grammar [5pts] (vi) Write a concise expression for L [10pts] (vii) Write a grammar for L