Which specification technique would be the weakest least pow

Which specification technique would be the weakest (least powerful; we talked about the layers of specification power) that is capable of describe this language? strings of three or more g\'s regular expression pseudorational grammar context free grammar language expression expressions consisting only of single digits separated by + such as 5 + 4 + 7 regular expression pseudorational grammar context free grammar language expression lists of digits such as (5, 4, 6, 3) regular expression pseudorational grammar context free grammar language expression a^m b^n: strings with m a\'s followed by n b\'s, m, n greaterthanorequalto 1 regular expression pseudorational grammar context free grammar language expression a^nb^n: strings with some number of a\'s followed by same number of b\'s, n greaterthanorequalto 1 regular expression pseudorational grammar context free grammar language expression strings of1\'s of an even length, containing only 1\'s regular expression pseudorational grammar context free grammar language expression binary strings containing an even number of 1\'s (at least one 1) regular expression pseudorational grammar context free grammar language expression

Solution

a) pseudorational grammer

b) context free grammer

c)language expression

d)context free grammer

e) pseudorational grammer

f) regular expression

g) pseudorational grammer