Using Chinese remainder theorem for Gaussian integers

Question

I have the following two questions that am trying to solve.

Use Chinese remainder theorem to solve this system of congruence

1. $x \equiv i \mod (1+i)$ and $x \equiv 2 \mod 3i$.

2. $x \equiv (−3+i) \mod 5$ and $x \equiv −i \mod (1−i)$.

When I solved it I got $x = -1$ for question 1 and $x = 2 + i$. But these are wrong. How do I solve this? Any help please?