need help with questions 1-3

Question1 1 pts In the problem of finding closest pair of points (chapter 5.4 of Algorithm Design by Kleinberg and Tardos), which of the following is false? O In the divide and conquer method, each divide step works in O(nlog(n)) time complexity The brute force method works in O(n2) time complexity The divide and conquer method works in O(nlog(n)) time complexity O In divide and conquer method, we need to sort the points in order of x-coodinate and y-coodinate Question 2 1 pts What is the expected running time of randomized quicksort? O(n*2) o O(n) O O(nlog(n)) o 0(1) Question 3 1 pts When proving the correctness of finding the closest pair of points algorithm in the book (chapter 5.4 of Algorithm Design by Kleinberg and Tardos), what variable was mathematical induction applied to? s and s Z (the subset of the plane) Size of Q O O Size of P