def find_alphabetically_last_word(text: str) -> str:
    """
    Given a string |text|, return the word in |text| that comes last
    lexicographically (i.e. the word that would come last when sorting).
    A word is defined by a maximal sequence of characters without whitespaces.
    You might find max() handy here. If the input text is an empty string, 
    it is acceptable to either return an empty string or throw an error.
    """
    # BEGIN_YOUR_CODE (our solution is 1 line of code, but don't worry if you deviate from this)

    return max(text.split())
   
    # END_YOUR_CODE