Question 1
Which algorithm is used to convert a Regular Expression directly into a Nondeterministic Finite Automaton (NFA) with $\epsilon transitions$?
Thompson's construction builds an NFA from a regular expression inductively by composing simple sub-automata for concatenation, union, and Kleene star.