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