The correct option is
C 8≡(0)(mod 4)![](https://search-static.byjusweb.com/question-images/byjus/infinitestudent-images/ckeditor_assets/pictures/596970/original_Capture.PNG)
With a modulus of 4 (since the possible remainders are 0, 1, 2, 3) we make a diagram like a clock with numbers 0, 1, 2, 3. We start at 0 and go through 8 numbers in a clockwise sequence 1, 2, 3, 0, 1, 2, 3, 0. After doing so cyclically, we end at 0. Therefore,
8≡(0)(mod 4)