The time complexity of computing the transitive closure of a binary relation on a set of n elements is
A. O(n)
B. O(nlogn)
C. O(n³/²)
D. O(n³)