For the last two parts of the shuffles question (Part 2, Question 3), we ignore the values ace to king on the cards and concentrate on the suits alone, so that we have 13 identical spades, 13 identical hearts and so on.
Clarification.
Note: this exam is closed-book, closed-notes, closed-device.
No discussion is allowed, please make sure your 1-hop neighborhood is empty.
A Hamiltonian path is a path that visits each vertex of the graph exactly once.
Show that every tournament* has a Hamiltonian path.
