Task: Generate All Possible Sequences of Coin Flips of Length n

In this part of the assignment, you will write a function that, when given a positive integer n$,$ will return all possible sequences of coin flips of length n $($i$.$e$.,$ all possible strings of length n that only contain H and T$).$

When the program is executed, it will generate all possible coin flips of length n $=1,2,$ and $3.$ This is done for you in the code we have provided at the bottom of the program $($between the two ### DO NOT MODIFY ### comments$).$ Below the # YOUR CODE HERE comment, you will write a recursive function called generate$\_$flips which has a single parameter $($n$)$ and which returns a list containing all possible strings of length n that only contain H and T$.$ The order of the strings does not matter. Your function must be recursive.

For example, when you run your program, your program should print the following $($where the coin flips in each list can be in any order$)$:

$[\text{'}$H$\text{'},\text{'}$T$\text{'}]$

$[\text{'}$HH$\text{'},\text{'}$HT$\text{'},\text{'}$TH$\text{'},\text{'}$TT$\text{'}]$

$[\text{'}$HHH$\text{'},\text{'}$HHT$\text{'},\text{'}$HTH$\text{'},\text{'}$HTT$\text{'},\text{'}$THH$\text{'},\text{'}$THT$\text{'},\text{'}$TTH$\text{'},\text{'}$TTT$\text{'}]$

Note: Your function must be recursive with respect to n$,$ but you are allowed to use loops within the Recursive Case or Base Case