= Which of the following is a phrase-structure grammar G = (V, T, S, P) that generates the language L containing all bit strings ending with 1 (i.e., all strings composed of 1s and Os but ending with 1)? None P = {S+51, SOS, +15, 5+1} V = {0, 1, S} T = { 0, 1} O O = P = {5+051, 5+151, 5 } V = {0, 1, S} T = {0, 1} O O P = {S-B1, BBO, B=B1, B-1} V = { 0, 1, B, S} T = { 0, 1} P = {S+A1, A-AO, A+A1, A} V = { 0, 1, A, S} T = { 0, 1}