The number of weighings required by the Fake Coin algorithm for a collection of $n$ coins $($where $n-1$ of the coins weigh the same and the fake coin is lighter$)$ is at most:

$n-1$

$\frac{n}{2}$

$n$

$log(n)$