The language L(G) where G = ( {S, A}, {0,1}, {(S, 11A), (S, 00), (A, 11) }, S ) is a finite language

a. True
b. False