Define the get_word_len_dict() function which is passed a string of text as a parameter. The function returns a dictionary with keys which are integers and corresponding values which are lists of unique words. The list of words corresponding to a key contains all the unique words from the text that have a length equal to the key value. The corresponding lists of unique words should be in sorted alphabetical order.

Note: the testing code makes use of the print_dict_in_key_order(a_dict) which prints the dictionary pairs in 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)

prints:

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'] def get_word_len_dict(text): return {}

def test_get_word_len_dict(): 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)