Need help to answer this multiple choice question

2-1 To sort { 8, 3, 9, 11, 2, 1, 4, 7, 5, 10, 6 } by Shell Sort, if we obtain ( 4, 2, 1, 8, 3, 5, 10, 6, 9, 11, 7) after the first run, and ( 1, 2, (2 point(s)) 3,5, 4, 6, 7, 8, 9, 11, 10 ) after the second run, then the increments of these two runs must be _, respectively. 0 A. 3 and 1 B. 3 and 2 O C. 5 and 2 D. 5 and 3 2-2 To sort N elements by heap sort, the extra space complexity is: (2 point(s) ) A. O(1) B. 0(logN) C. 0(N) OD. O(NlogN) 2-3 To sort N records by merge sort, the worst-case time complexity is: (2 point(s)) OA. O(logN) B. O(N) C. (NlogN) OD. O(N2)