C 1. In the merge step of Merge sort of N elements what is the running time cost of that step? a. 0(1) b. O(log N) CO(N) d. O(N log N) e. O(N2) 2. One of the following is used in Topological Sorting: a. BFS b. DFS c. Heap d. All of them 3. Memory required to represent a graph using adjacency list is: a. (ED) b. (112) c. (VI+ |ED) d. None of them 4. Time to determine if (u, v) E in a graph represented by adjacency matrix is: a. (1) b. (log V1) c. O (degree(u)) d. O (degree(v) e. O(ED) 5. The INCREASE-KEY operation in a priority queue with Size N has running time: a. O(l) b. O(log N) c. O(N) d. O(N log N) e. O(N2)