Define the get_word_len_dict() function which is passed a stringof text as a parameter. The function returns a dictionary with keyswhich are integers and corresponding values which are lists ofunique words. The list of words corresponding to a key contains allthe unique words from the text that have a length equal to the keyvalue. The corresponding lists of unique words should be in sortedalphabetical order.

Note: the testing code makes use of theprint_dict_in_key_order(a_dict) which prints the dictionary pairsin sorted key order.

For example, the following code:

text = “May your coffee be strong and your Monday be short”the_dict = get_word_len_dict(text)print_dict_in_key_order(the_dict)print()text = ‘why does someone believe you when you say there are four billion stars but they have to check when you say the paint is wet’the_dict = get_word_len_dict(text)print_dict_in_key_order(the_dict)


2 : [‘be’]3 : [‘May’, ‘and’]4 : [‘your’]5 : [‘short’]6 : [‘Monday’, ‘coffee’, ‘strong’] 2 : [‘is’, ‘to’]3 : [‘are’, ‘but’, ‘say’, ‘the’, ‘wet’, ‘why’, ‘you’]4 : [‘does’, ‘four’, ‘have’, ‘they’, ‘when’]5 : [‘check’, ‘paint’, ‘stars’, ‘there’]7 : [‘believe’, ‘billion’, ‘someone’]