Number TheoryChallengeFactors & Multiples ShareFactors & Multiples · Challenge problemFor which pair does the Euclidean algorithm need the MOST divisions?A(143,91)(143, 91)(143,91)B(150,149)(150, 149)(150,149)C(144,89)(144, 89)(144,89)D(200,1)(200, 1)(200,1)Check Show answer Walk through it step by step Practice more like this Review this concept