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 \log n)$$

B

$$O(n^{\frac{3}{2}})$$

C

$$O(n^{3})$$

D

$$O(n)$$