$14\mathrm{.}8$ Multiple Constructions

Consider the regular expression $($ab$)*.$ Suppose we construct a $\backslash$lambda $-$NFA from this expression, remove its $\backslash$lambda $-$moves by the construction, and convert the resulting ordinary NFA to a DFA by the Subset Construction. Then the resulting DFA is minimal.