Solution

Correct answer is Option1Concept:G = (V,T,P,S)

1. G is a grammar, which consists of a set of production rules. It is used to generate the strings of a language.
2. T is the final set of terminal symbols. It is denoted by lower case letters.
3. V is the final set of non-terminal symbols. It is denoted by capital letters.
4. P is a set of production rules, which is used for replacing non-terminal symbols 

5. S is the start symbol used to derive the string.

Explanation: Grammer G:

S → AbB

A → aAb ∣ λ

B → bB ∣ λ

language L is generated by grammer G is:

L = {anbm ∶ n ≥ 0, m > n}

String can be generated by grammer G is:

{b, bb, abb, abbb....} here an ∶ n ≥ 0 and bm ∶ m > n

Option 2: False

L = {anbm ∶ n ≥ 0, m ≥ 0}

Option 3: False

L = {anbm ∶ n ≥ m}

Option 4: False

L = {anbm ∶ n ≥ m, m > 0}