The time complexity of computingthe transitive closure of binary relation on 2 Set Of m elements S known to be

A

$$O(n)$$

B

$$O(n * \log(n))$$

C

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

D

$$o(n^3)$$