Whenever you're ready, walk me through how you'd approach this.
You play a game where you flip a coin repeatedly; you win if 4 tails shows up and I win if 4 heads shows up, not necessarily in a row; what is the maximum number of turns this game can take?
Determine the maximum possible number of flips before either player wins. Provide a proof that the bound cannot be exceeded and construct a sequence that achieves it. Assume every flip produces exactly one outcome, heads or tails, and both outcomes are possible.