You have an index card with the letter K written on one side, and F on the other. You want to see ALL of the possible ways the card will land if you...

You have an index card with the letter K written on one side, and F on the other. You want to see ALLof the possible ways the card will land if you drop it n times. Write a recursive function that prints eachsession of dropping the cards with K's and F's.