Consider the process described in the text in which an [math]n[/math]-card deck is repeatedly labelled and 2-unshuffled, in the manner described in the proof of Theorem. (See Figure and Figure.) The process continues until the labels are all different. Show that the process never terminates until at least [math]\lceil \log_2(n) \rceil[/math] unshuffles have been done.