Last substring

Write a program to find the alphabetically last substring of a string. In other words, if you were to write out all the substrings of a string and then sort them alphabetically, the last one would be the answer. For example "ab" -> "b", "banana" -> "nana", "bananb" -> "nb".