Hi how to do this is python?

Exercise 1 - Anagrams Given a list of words, design and implement an efficient algorithm to group all anagrams together. Words w1 and w2 are said to be anagrams if by rearranging the letters of w1, we can get w 2 using all the original letters of w1 exactly once. Example: Given the list of words [eat, tea, part, ate, trap, pass], your algorithm should output: [eat, tea, ate] [part, trap] [pass] Hint First sort each individual word (rearrange its characters alphabetically), then sort the list of rearranged words