Question 3 (a) Given an array of doubles, write a static method to find the pair of doubles that are closest in value. Your function must run in time proportional to NlogN, where N is the length of the array. Your method should print the two values using System. out.print (double d). You can use the method Arrays. sort (double [] a), which sorts an array using quicksort. public static void closestPair (double[] a) \{ (b) What is the order of growth for your closestPair function? Circle the best answer. 1logNNlogNN2N2logNN32N