Show complement of language in same complexity class? If $L$ is a binary language ($\Sigma = (0, 1)^*$) and $\overline{L}$ is the complement of $L$, the set of binary strings not in $L$.

How can I show that, if $L$ is in the complexity class $P$, then so is $\overline{L}$?
Hint: Given a polynomial time algorithm for $L$, come up with a polynomial time algorithm for $\overline{L}$.