Write a grammar for the language consisting of strings that have n copies of the letter "a" followed by the same number of copies of the letter "b", where n>0. For example, the strings "ab",...

Urgent Help Needed ASAP!!!!
0. For example, the strings "ab", "aaaabbbb", and "aaaaaaaabbbbbbbb" are in the language but "a", "abb", and "aaabb" are not. Edit Format Table 12pt v Paragraph v В I A MacBook Air DII 80 888 F8 F7 F6 F5 F2 F3 F4 2$ % "/>
Extracted text: Write a grammar for the language consisting of strings that have n copies of the letter "a" followed by the same number of copies of the letter "b", where n>0. For example, the strings "ab", "aaaabbbb", and "aaaaaaaabbbbbbbb" are in the language but "a", "abb", and "aaabb" are not. Edit Format Table 12pt v Paragraph v В I A MacBook Air DII 80 888 F8 F7 F6 F5 F2 F3 F4 2$ %