Que: The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________ a. O(n) b. O(logn) c. O(n⁽ⁿ⁺⁽³/²⁾⁾) d. O(n3) Answer: O(n³)