You have a card on which the letter J is written on one side and K on the other. You want to see all of the possible w ays the card will land if you drop it n times. Write a recursive method that...

You have a card on which the letter J is written on one side and K on the other. You want to see all of the possible w
ays the card will land if you drop it n times. Write a recursive method that prints each session of dropping the cards
with J's and K's in java?