Construct DFA for a power n, n>=0 || RGPV TOC

RGPV 2009
Q. Construct DFA for anb | n>=0.

Ans. Some example strings = {ab, aab, aaab, aaaab}
Minimum number of states required = 2.