Exercise 2.2.8: Let A be a DFA and a particular input symbol of A, such that for all states q of A we have delta(q,a) = q.
A) Show that for all n >= 0, Delta cap(q, a^n) = q. where a^n is the string consisting of n a's.
note delta = δ and delta cap = δˆ.