9. In merge sort, the merge step takes comparisons for n items. at most a. n b. n-1 c. 2n d. nlogn e. logn 10. How does a queue organize it items? a. b. c. d. according to the order in which they were added by priority alphabetically randomly 11. Two vertices in an undirected graph if they are joined by an edge are a. near b. adjacent c. connected d. visited 12. What would the stack look like, after the following code executes? for(int k = 1; k