Pigeonhole and Extremal Arguments · Superchallenge problem

In a round-robin tournament with $6$ players in which NOBODY is unbeaten, what is the smallest possible number of kings (players who reach everyone in one or two steps)?