Let's pose the problem a bit different to make it a generalcase:

if OURSPONSOR is a set of strings accepted by a given TG,prove that a new TG over the same
alphabet can be created, whichwill contain all strings which end with words
fromOURSPONSOR.
The problem might be easily solved by adding the followingtransition:

this will add all possible beginnings of strings ending withwords from initial TG
(OURSPONSOR let's say)