The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be

• A. O(n × logn)
• B. O (\(n^{\frac{3}{2}}\))
• C. O(n3)
• D. O(n)