Describe the logic and execution of the Merge Sort algorithm in plain English. Use a shuffled deck of 52 playing cards as the physical reference point for your explanation. Walk the reader through the process of dividing the deck, sorting the sub-piles, and merging them back together in order. You must not use code, pseudo-code, or mathematical notation, relying solely on descriptive text of the physical actions.