Suppose we have a standard deck of cards arranged in some order. We shuffle the cards by cutting the deck into two halves: Cards in positions and . Then, we alternate cards from each half of the deck. Namely, the cards in positions are now in positions . and the cards in positions are now in positions . What is the minimum number of shuffles needed before the deck returns to it's original state?