We have a deck of cards in hand, where we take the top card off the deck, place it onto a table, then place the next top card onto the bottom of the deck. Repeat this process until deck in hand is empty, then take the deck from the table and place into hand. This is called one round. How many rounds does it take for the deck to return to its original order? Design a class in C++ to model and solve this problem.
