Must be in Python 3.

Purpose: To find every possible permutation of letters in a word using recursion Degree of Difficulty: Tricky In the game of Scrabble, players take turns placing lettered tiles onto a board to form words. The goal of the game is to score more points than the other players. Knowing all of the possible words can create a significant advantage! For this question, we are going to write a recursirve function to help us play Scrabble. A player has a set of tiles with letters, but isn't sure what words can be made with them. So our function is going to returna list containing every permutation of the letters in that word What is a permutation? It is simply the result of changing the order of a set of objects. In this case, we are going to take the letters in a word and mix them up into every combination possible. For example, the word bad has the following permutations: bad, bda, abd, adb, dba, dab and the word rip has the following permutations: rip, rpi, irp, ipr, pri, pir Program Design Write a function permutations which is recursive. It should take only one parameter, which should be a list of characters. Your function should return a list of Lists that contain all the permutations in a similar format as described above. Below is some helper code, to help you create such a list, and the expected return values string cat" list_of_characters[char for char in string] answer permutations (list_of_characters) print(answer) Note: The above code is an example showing how your code could run; permutations is the function that you should be creating! Making this solution recursive isn't an easy task, so here are some hints to help you . You may need to use up to two loops inside of your recursive function! This is ok! However, your function still needs to effectively use recursion for full marks. Only worry about permutations that include the same number of letters. (For example: all permuta tions of cat" should have 3 letters.) . Slicing will be very important for this question! Duplicate words will happen when there are several of the same letter in a word. Do not worry about removing duplicates! What to Hand In . A document called a7q2.py containing your finished program, as described above