Question

Euclid's Division Lemma states that for any two positive integers a and b there exists unique integers q and r such that a = bq + r , where r must satisfy:
(a) 0_<r_<b
(b) 0_<r <b
(c) 0< r _<b
(d) 0< r <b​

Answer 1

Step-by-step explanation:

the answers is (B)

mark as brainlist

follow me

Answer 2

Answer:

b is the ans

this is correct