Q.No.2 (a) What is the basic theme for theoretical study though being a student of practical field of computer science? (10 Marks) (b) How can you define equivalent FAs? Do discuss with suitable examples that there exists some machine that do not recognize any language at all? (c) How can you define a recognizer/acceptor in terms of input and output? Q.No.3 (a) Show that the following pairs of regular expressions (ab)*a and a(ba)*) define the same language over the alphabet = {a,b) (10 Marks) (b) What is deductive reasoning and where we use this? How can you differentiate between proof by induction and proof by contradiction