I WANT ONLY THE ANSWERS

6. The minimum number of comparisons needed to find the Simultaneous Min. Max values of n even en elements is a. 2n-1 b. (3n-3)/2 c. (3n/2)-2 d. (3n-2)/2 b. n3 7. The running time of the best algorithm for finding the median of a sorted sequence of n values is in the order (Big-0) of: a. Ign c. 1 d. n 8. The running time needed to determine if the edge (u, v) E and the graph represented by an adjacency list: a. O(degree(u) b. (ED) c. (VI+ |ED) d. (VD) 9. The running time needed to traverse the adjacent nodes for the node u in the graph represented by an adjacency matrix: a. 6 (degree(u)) b. O(E) c. (IV+ |ED) d. (VD) 10. The running time of breadth-first search on a graph GV.E) represented in an adjacency list is a. O(E2) b. O(E+V) c. O(12) d. O (E log V) e. None