A Using the divide and conquer algorithm strategy the closest pair of points can be found in O(N)O(logN)O(NlogN)O(N2) B Insertion Sort algorithm on N elements is an example of application of design strategy Brute Force Divide and conquer Variable size strategy Decrease and conquer C The closed formula for the sum i=0102i is 1023204710242400 D The sum j=120i=2103 is 75127540600