Question 4
A deck consists of $n$ different cards. A move consists of taking out a stack of consecutive cards from the deck, and then putting the same stack back somewhere else within the deck without flipping any of the cards or changing the order of cards within the stack. You are required to reverse the original order of cards in the deck by such moves. What is the minimum number of moves required if
(i) $n=5$
(ii) $n=9$
(iii) $n=13$
(i) $n=5$
(ii) $n=9$
(iii) $n=13$