please make sure all of the ans are correct :)

14. Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced). C) A. Quick Sort B. Heap Sort C. Merge Sort D. Insertion Sort 15. The structure of a heap must be a ( A. non-binary tree B. binary search tree C. complete binary tree D. full binary tree 16. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array? () A. 4 B. 2 C. 1 DO 17. Which of the following sequence corresponds to a heap? ( ) A. 37, 99, 45, 33, 66, 10, 22, 13 B. 99, 45, 66, 13, 37, 10, 22, 33 C. 99, 66, 45, 33, 37, 10, 22, 13 D. 99, 66, 22, 33, 37, 13, 45, 10 18. To build a heap from N records, the best time complexity is: ? A. O(logn) B. O(n) C. O(nlogn) D.(n)