Lab$11$B: Show me where it is

Write a method called letterPositions$()$ which takes in two strings and returns a tuple. The first string

can be a phrase of any length while the second one will always be a single character. The tuple that the

method returns must contain the index of all occurrences of the second string inside the first string. Be

sure to not discriminate between upper and lower case $($i$.$e$.$: a and A should be the same character$).$ If

the resulting output is an empty tuple, simply return the empty tuple.

Outside the method, prompt the user for a phrase, a letter, and then print out the resulting tuple as per

the sample outputs.

Note: You can assume both inputs are always strings, and that the second input is always a single

character.

Sample outputs $($user input in bold$)$:

Enter your phrase: bAnAna

Enter a letter: a

a appears inside your phrase in the following positions: $(1,3,5)$

Enter your phrase: The only thing we have to fear is fear itself!

Enter a letter: $f$

$f$ appears inside your phrase in the following positions: $(26,34,44)$

Enter your phrase: What? $9000?$ There's no way that can be right!

Enter a letter: $Z$

$z$ appears inside your phrase in the following positions: $0$

CODE IN PYTHON PLEASE