Show that, over the unary alphabet sigma = {0}, if a language has the pumping property for regular languages then it also has the pumping property for context-free languages.
(note that this means that when you prove, using the pumping lemma, that a language over a unary alphabet isn't context-free, you have also proved that it isn't regular.)