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 ways the card will land if you drop it n times. Write a recursive method that...

I need the answer as soon as possible

Extracted text: 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 ways 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. For example if you drop it 4 times in a given session, all possible ways to drop it are as follows (in exactly the specified order): J J J J J J J K J J K J J J K K J K J J J K J K J K K J JK K K K J J J K J J K K J K J кукк K K J J K K J K K K K J ккк к