Please answer all

Problem 1 For regular expression: (a+ba a(ba) Identify alphabet and convert the regular expression to Nondeterministic Finite Automaton (NFA) Problem 2 Convert the NFA from problem 1 to Deterministic Finite Automaton (DFA) Problem 3: Suppose there is a programming language D++ in which arithmetic expressions are given in the following form Infix Notation A+B A-B A B A/B A (B+C A B+C AB!+ AB! AB$ ABS ABCI+S ABS CI4 Create a Context-Free Grammar for language D++. Identify terminals and non-terminals. Is this grammar ambiguous? Problem 4 Demonstrate a parse tree for expression: ABS CDI+$ Problem 5 Create a DFA for a bottom-up parsing using grammar EE+TIT, T-(E)11. Using the DFA, demonstrate bottom-up parsing for expression: 1+1)+1