Problem 5.3: Here are eight simple grammars, each of which generates an infinite language of strings. These strings tend to look like alternating a 's and b 's, although there are some exceptions, and not all grammars generate all such strings. 1. SabSab 2. SSSab 3. SaBBbSa 4. SaBBbSb 5. SaBBbSab 6. SaBb;BbS 7. SaBa;BbS 8. SaBab;BbS The initial symbol is S in all cases. Determine the language of each of these grammars. Then, find, in the list below, the pair of grammars that define the same language