Donovan is going to add many numbers. each number will use only the digit 1. what is the greatest number of addends donovan can use without having to regroup? explain.

c

step-by-step explanation:

there is vertical asymptote at x = 2 and x = 0

vertical asymptote occurs at the points where the denominator is 0. so we can say that

x = 2 occurs when there is a factor (x-2) in the denominator, and

x = 0 occurs when there is a factor "x" in the denominator

thus, the denominator of the equation would have "x * (x-2)", this is option c only. that's the correct answer.

3000000000000000000000