What is the total running time of Euclid’s algorithm?

• A. O(N)
• B. O(N log M)
• C. O(N log N)
• D. O(log N +1)