All three please!!

5. Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search (DFS) of G? Assume that the graph is represented using adjacency matrix. A. O(n) B. O(m+n) C. O(n2) D. O(m x n) 6. Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? B. O(log n) C. O(n) D. O(n log n) Which of the following represents the order of complexity of the KMP pattern matching algorithm, with m representing the length of text and n representing the length of pattern: A. O(n+m) B. O(log n) C. O(n) 7