Answer : B
if we consider each options one by one
The language corresponding to the given grammar is a set of even number of a’s then Language generated by it would be
L1 = {∈ , aa , aaaa .......}
The language corresponding to the given grammar is a set of odd number of a’s then Language generated by it would be
L2 = {a . aa , aaaaa ......}
The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s
L3 = {b , bbb ,bbbbb , bbbbbbb , aab , aabbb , aaaab ,aaaabbb... , }
The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s
L4 = {a ,aaa ,aaaaa ,aaaaaaa , abb ,abbbb ,aaabb ,aaabbbb.........}
Language L1 can generate "∈" but not grammar so option 1 is not correct
Language L3 can generate "b" but not grammar so option 3 is not correct
Language L4 can generate "abb" but not grammar so option 4 is not correct.
Grammar can generate all the strings which can be generate by option 2 language.