How many solutions does $x^2\equiv 1$ a) $\mod 2$, b) $\mod p$ where $p$ is prime and can be written as $4k+3$ ( $k\in\mathbb{Z}$), c) $\mod p$ where $p$ is prime and can be written as $4k+1$ ( $k\in\mathbb{Z}$).