1a-f) Multiple Choice: Select the best answer and write it on the blank. Also provide the specification for the language. (28pts)

Which specification technique would be the weakest (least powerful; we talked about the layers of specification power) that is capable of describe this language?

_C__ a) strings of three or more gs A. regular expression C. pseudorational grammar B. context free grammar D. language expression

__ b) expressions consisting only of single digits separated by + such as 5 + 4 + 7 A. regular expression C. pseudorational grammar B. context free grammar D. language expression

___ c) lists of digits such as ( 5, 4, 6, 3 ) A. regular expression C. pseudorational grammar B. context free grammar D. language expression

___ d) ambn : strings with m as followed by n bs , m,n 1 A. regular expression C. pseudorational grammar B. context free grammar D. language expression

___ e) a^(n)b^(n) : strings with some number of as followed by same number of bs , n 1 A. regular expression C. pseudorational grammar B. context free grammar D. language expression

___ f) strings of 1s of an even length, containing only 1s A. regular expression C. pseudorational grammar B. context free grammar D. language expression

___ g) binary strings containing an even number of 1s ( at least one 1 ) A. regular expression C. pseudorational grammar B. context free grammar D. language expression