Test 1 (COMP3560)- Introduction to Computer Theory (Automata and Formal Languages) Solve the following problems. Please write your answers in readable and clean form. Consider a set of symbols = {a,b,c). (1) Find all strings in * shorter than 2. (2) Let L = { , a, bc). Is L a language on ? Why? (3) Write t and L. Let = {a,b). What language does the grammar with the following productions generated? Writ the language. S BA