Que: The time complexity to test whether a graph is bipartite or not is said to be _______ using depth first search. a. O(n³) b. linear time c. O(1) d. O(nlogn) Answer: linear time