0 Start So 0 S1 0 a. What is the language recognized by the given nondeterministic finite-state automaton? b. Draw a deterministic finite-state machine that recognizes the same language as the NFA above. 0. Start 0. 1 S3 0 What is the language recognized by the given nondeterministic finite-state automaton? Draw a deterministic finite-state machine that recognizes the same language as the NFA above. Problem 11 a. Construct a grammar that generates all signed decimal numbers, consisting of a sign, either +or a non-negative integer; and a decimal fraction that is either the empty string or a decimal point followed by a positive integer, where initial zeros in an integer are allowed. The grammar should be specified using the Backus-Naur form b. Show the derivation for -31.4 in this grammar Problem 12 Give production rules in Backus-Naur form that generate all identifiers in the C programming language. In C an identifier starts with a letter or an underscore (-) that is followed by one or more lowercase letters, uppercase letters, underscores, and digits