Which of the following describes the number of solutions to ax≡b(modm)ax \equiv b \pmod{m}ax≡b(modm) where d=GCD(a,m)d = \text{GCD}(a, m)d=GCD(a,m)?
It has ddd solutions if d∣bd|bd∣b
It has 111 solution if d∣bd|bd∣b
It has m/dm/dm/d solutions if d∣bd|bd∣b
It has no solutions if d∣bd|bd∣b