Prove that there is an n-vertex tournament with in-degree equal to outdegree at every vertex if and only if n is odd.
a) If n is odd, then the tournament satisfies the condition.
b) If n is even, then the tournament satisfies the condition.
c) The condition is satisfied for all n.
d) The condition is never satisfied.
