The Great Houdini is performing again! Everybody wants to see the famous magician and the magic show is sold out. Today Houdini shows the following sophisticated trick:
- A guy from the audience carefully shuffles a deck of $52$ cards ($13$ spades, $13$ hearts, $13$ clubs and $13$ diamonds), and hands the deck over to Houdini's assistant.
- The assistant then repeats the following step $52$ times: He looks at the top card (of course without showing it to Houdini), and puts it face-down on the table. Houdini guesses the suit. Then the assistant flips the card over and reveals it to everybody (including Houdini). Then the step is repeated.
Houdini's goal is of course to make as many correct guesses as possible. A predecessor puzzle showed us that without cheating Houdini will only predict $13$ cards correctly (in the worst case). Today, however, Houdini and his assistant indeed are cheating:
The backsides of the cards are not perfectly symmetric. The assistant has two different ways of putting down every card, and hence may communicate to Houdini one bit of information per card.
Question: Is there a cheating strategy for Houdini and his assistant that guarantees Houdini to make (a) at least $27$ correct guesses (b) at least $32$ correct guesses (even in the worst possible case)?