7. Which of the following sets is not convex? a. points on the circumference and inside a circle b. points on the boundary of and inside a square c. a straight line extending to infinity in both directions d. set of 2 distinct points 8. Finding the two nearest neighbors in a list has a time complexity of a. O(log n) b. 0(2") c. O(n12) d. O(n2) 9. Matching a substring of length m in a string of length n and has a time complexity (i.e., worst case time complexity) T(n)- a. n log m b. log n c. log m d. mn 10 The conex hull algorithm has a time complexity of a. O(log n) b, 0(n) c. O(n log n) d. 0(n) problem finds a path through a graph that traverses each edge once. 11. The a. konigsberg bridge problem b. knapsack problem c. traveling salesman problem d. topological homomorphism 12. The problem finds a path through a graph that visits each vertex once a. konigsberg bridge problem b. knapsack problem c. traveling salesman problem d. topological homomorphism 13. The tower of hanoi problem requires a. 2n-1 b. n! c. 2-1 d. n log n steps to move n disks. 14. The number of ways you can select 2 objects out of n objects is a. n(n+1)/2 b. log n c. n(n-1)/2 d. n