The time complexity to test whether a graph is bipartite or not is said to be _______ using depth first search.

The time complexity to test whether a graph is bipartite or not is sa

1.	The time complexity to test whether a graph is bipartite or not is said to be _______ using depth first search.
A.	O(n3)
B.	linear time
C.	O(1)
D.	O(nlogn)
Answer» C. O(1)