Part 1: rearrange a deck of cards, based on a sequence of known permutations a standard playing card deck contains 52 cards, 13 values in each of four suits. the values are named 2, 3, 4, 5, 6, 7, 8, 9, 10, jack, queen, king, ace. the suits are named clubs, diamonds, hearts, spades. a particular card in the deck can be uniquely identified by its value and suit, typically denoted value of suit. for example, "9 of hearts" or "king of spades". traditionally a new deck is ordered first alphabetically by suit, then by value in the order given above. the big city has many casinos. in one such casino the dealer is a bit crooked. she has perfected several shuffles; each shuffle rearranges the cards in exactly the same way whenever it is used. a very simple example is the "bottom card" shuffle which removes the bottom card and places it at the top. by using various combinations of these known shuffles, the crooked dealer can arrange to stack the cards in just about any particular order. you have been retained by the security manager to track this dealer. you are given a list of all the shuffles performed by the dealer, along with visual cues that allow you to determine which shuffle she uses at any particular time. your job is to write a program that will predict the order of the cards after a sequence of shuffles.