Suffix language

Another question.
Can anybody show me how to proof somethin like this.
Suffix of word A is any end part of word A (i.e. A=abbb, so suffixes
are: empty, b, bb, bbb, abbb).
So if L is regular language then suffix-language is also regular.
I know how to do it for preffixes.
Help. Please.

Depressed
Pi

.