Convert the following regular expression to NFA using Thompson’s construction:

(a|b)*a(a|b)

Then convert this NFA to DFA using subset construction method. Finally, minimize the DFA using state minimization algorithm.