[C++ code] Using Recursion -- Read a single integer from the keyboard. Assume this integer represents the number of times you want to flip a coin (with two sides: H and T for heads and tails respectively). Show all possible outcomes of H and T for flipping the coin this many times.

***You must use recursion for this problem.***

You may not use any loops (or goto) to solve this.

Example 1 (user input is in bold):

Coin flips? 1

T H

Example 2 (user input is in bold):

Coin flips? 2

TT TH HT HH

Example 3 (user input is in bold):

Coin flips? 3

TTT TTH THT THH HTT HTH HHT HHH