enter image description hereplease give its answer!a) Differentiate between NFA and DFA with examples.
[C
b) Construct Deterministic Finite Automata (DFA) without constructing NFA for the following Regular Expressions:
i. 1001(1/0)* 101
ii. 001(0/1)101(1/0)*110
c) Draw an NFA and DFA for the language accepting strings with an odd number of 1’s followed by single o over input alphabets ∑ = {0, 1}.