a^p, p is prime

Hi
I would like to know if there is a type 0 or type 1 grammar that can
generate a^p, where "a" is the terminal alphabet, and "p" is a
prime...
And if you know the solution, please suggest a hint :) Not the answer!

.