Please Answee the following questions:

$1.$ Describe the differences between a DFA and an NFA. Which is better suited for

a lexical analyzer and why?

$2.$ Construct a DFA for the following regular expression: a$($b$|$c$)*$d$.$

Walk through the steps of constructing the DFA, showing the states, transitions, and

accepting state.

$3.$ Given the regular expression $($a$|$b$)*$ab$,$ perform the following tasks: a$.$

Construct an NFA using Thompson$$s construction.

b$.$ Convert the NFA to a DFA using the subset construction algorithm.

c$.$ Minimize the resulting DFA.

$4.$ Construct an RE$,$ an NFA, and a DFA that recognizes the following tokens:

$1.$ Keywords: int, float, return, if$,$ else

$2.$ Operators: $+,-,*,/$

$3.$ Identifiers: Strings starting with a letter followed by letters and digits.