PLEASE ANSWER IT WITH PYTHON

Write a function top5_words(text) that takes a single argument text (a non-empty string), tokenises text into words based on whitespace (once again, without any stripping of punctuation or case normalisation), and returns the top-5 words as a list of strings, in descending order of frequency. If there is a tie in frequency at any point, the words with the same frequency should be sub-sorted alphabetically. If there are less than five distinct words in text, the function should return the words in descending order of frequency (with the same tie-breaking mechanism). For example:

>>> top5_words("one one was a racehorse two two was one too")

["one", "two", "was", "a", "racehorse"]

>>> top5_words("buffalo buffalo buffalo chicken buffalo")

["buffalo", "chicken"]

>>> top5_words("the quick brown fox jumped over the lazy dog")

["the", "brown", "dog", "fox", "jumped"]

TIPS

One trick that you may find useful is that when sorting a list of tuples, sorting is done based on the first element, and if there is a tie in the value of the first element, the second element is used to break the tie, etc. For example:

print(sorted([(1, 4), (1, 2), (1, 1)]))

print(sorted([(1, 'b'), (1, 'a'), (0, 'z')]))