Please show all work.

In class, we created a TM that recognized a^i b^j, where i is evenly divisible by j. Using that, describe a TM that recognizes a^P, where p is prime. You don't have to write out the transition table, but try to describe the states in terms of the subroutines they perform. When you mention a subroutine, give an estimate of how many states it would take to implement it (one, a couple, several, etc)