Write a Python program that chooses a word of a specified length at random from the lexicon and displays it to the user in a random, scrambled order. Then let the user guess words of varying lengths that can be formed using the letters of the word and the same number of occurrences or less as they appear in the word. After every guess, respond to the user whether the guess was correct, and add it to the list of words that have been guessed so far. Print results grouped by length of words and alphabetized within each group.

Here is a sample execution:

$ python$3$ wordgame.py

Enter the range of word lengths $($low$,$high$)$:$3,6$

renbur:

$[\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'}]$

$[\text{'}----\text{'},\text{'}----\text{'},\text{'}----\text{'},\text{'}----\text{'}]$

$[\text{'}-----\text{'}]$

$[\text{'}------\text{'}]$

Enter a guess: bur

Correct!

urnrbe:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'}]$

$[\text{'}----\text{'},\text{'}----\text{'},\text{'}----\text{'},\text{'}----\text{'}]$

$[\text{'}-----\text{'}]$

$[\text{'}------\text{'}]$

Enter a guess: burr

Correct!

ubenrr:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'}]$

$[\text{'}----\text{'},$ 'burr', $\text{'}----\text{'},\text{'}----\text{'}]$

$[\text{'}-----\text{'}]$

$[\text{'}------\text{'}]$

Enter a guess: run

Correct!

rebnur:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},$ 'run', $\text{'}---\text{'}]$

$[\text{'}----\text{'},$ 'burr', $\text{'}----\text{'},\text{'}----\text{'}]$

$[\text{'}-----\text{'}]$

$[\text{'}------\text{'}]$

Enter a guess: rune

Correct!

brurne:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},$ 'run', $\text{'}---\text{'}]$

$[\text{'}----\text{'},$ 'burr', $\text{'}----\text{'},$ 'rune'$]$

$[\text{'}-----\text{'}]$

$[\text{'}------\text{'}]$

Enter a guess: foo

Sorry. Try again

renrub:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},$ 'run', $\text{'}---\text{'}]$

$[\text{'}----\text{'},$ 'burr', $\text{'}----\text{'},$ 'rune'$]$

$[\text{'}-----\text{'}]$

$[\text{'}------\text{'}]$

Enter a guess: burner

Correct!

nrrebu:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},$ 'run', $\text{'}---\text{'}]$

$[\text{'}----\text{'},$ 'burr', $\text{'}----\text{'},$ 'rune'$]$

$[\text{'}-----\text{'}]$

$[\text{'}$burner$\text{'}]$

Enter a guess: burn

Correct!

enurrb:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},$ 'run', $\text{'}---\text{'}]$

$[\text{'}$burn$\text{'},$ 'burr', $\text{'}----\text{'},$ 'rune'$]$

$[\text{'}-----\text{'}]$

$[\text{'}$burner$\text{'}]$

Enter a guess: urn

Correct!

nebrur:

$[\text{'}---\text{'},\text{'}---\text{'},$ 'bur', $\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},\text{'}---\text{'},$ 'run', 'urn'$]$

$[\text{'}$burn$\text{'},$ 'burr', $\text{'}----\text{'},$ 'rune'$]$

$[\text{'}-----\text{'}]$

$[\text{'}$burner$\text{'}]$

Enter a guess: q

$[\text{'}$brr$\text{'},$ 'bun', 'bur', 'err', 'nub', 'rub', 'rue', 'run', 'urn', 'burn', 'burr', 'rube', 'rune', 'rerun', 'burner'$]$

Note that you first prompt the user for the range of word lengths to consider. The largest length requested $(6$ in this case$)$ determines the length of the word that you will choose randomly from the lexicon $($burner$$ here$).$ Note also that you shuffle the word on each iteration. Entering the string $$q$$ quits the program. Display each list of same$-$length words guessed in alphabetical order.

Print all words at the end of the game, as shown above.

If there are no words of a particular length, just ignore them altogether $($note no words of length $5$ below in $$seaway$$ with a length range of $4$ through $6)$:

esaywa:

$[\text{'}$away$\text{'},\text{'}----\text{'},$ 'ayes', 'easy', 'sway', 'ways', 'yaws', 'yeas', 'yews'$]$

$[\text{'}------\text{'}]$

You may find itertools.groupby, random.choice, and random.shuffle helpful.