PLease read the instructions very carefully and understand what I have already done and am trying to fix. **PLEASE DO NOT ANSWER IF YOU DO NOT KNOW AND WASTE MY QUESTION**

THE QUESTION IS: FIND CFGs that generate these regular languages over the alphabet (a b) (vii) All strings with an odd number of a's OR an even number of b's

They need to accept and reject specific strings. With the work that I have done they accept and reject the corrct string WITH THE EXCEPTION OF 'aa' PLEASE help me solve where I have gone wrong this is the work i have completed I NEED TO KNOW HOW TO FIX THIS SO THAT IT WILL REJECT THE 'aa'

THESE WORDS MUST ACCEPT a bb abb aaba aabba ba baba baaa babbbaaaba THESE WORDS MUST REJECT b bbb aa aab aabbb abbbaaabb abbab bbbbbbaab

BAI! 6 3 BAI! 6 3