The Chinese Remainder Theorem · Easy problem

Find the inverse of $4$ modulo $9$: the integer $k$ with $0 \le k < 9$ and $4k \equiv 1 \pmod 9$.