Variation on 13.145] Let G = (V, T, S, P) be the phrase-structure grammar with V = {0, 1, A, B,S), T = { 0,1 }, and set of productions P consisting of S0A, S 1A, A 08, B 1A, B-1. 1. (a) Generate the six shortest strings in the language generated by G. [5 points] Replace this text with your answer (b) Find the shortest non-empty string(s) not belonging in the language gen- 5 pointsi] Replace this text with your answer. erated by G. (c) What is the total number of strings of length n in the language generated by G, for any neZ+? [5 points]