According to Gabriel lame, how many steps does Euclid’s algorithm require to solve a problem?

• A. Less than five times the number of digits
• B. More than five times the number of digits
• C. Less than two times the number of digits
• D. More than two times the number of digits