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. s → abs | abs → ss | abs → ab; b → bs | as → ab; b → bs | bs → ab; b → bs | abs → ab | b; b → bss → ab | a; b → bss → ab | ab; b → bsthe 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. a) g1: s → ab, b → bs, b → bg2: s → ab, b → bs, s → bb) g1: s → ab, b → bs, b → ag2: s → ab, b → bs, b → bc) g1: s → ab, b → bs, b → bg2: s → ab, b → bs, s → abd) g1: s → ab, b → bs, b → abg2: s → ss, s → ab