Data Structures help

5. Insertion sort can be improved by using binary search to find the next insertion point. However, this does not change the overall complexity of the algorithm. Why? 6. The standard quick sort algorithm is O(n') in the worst case. What is the worst case? What modifications can be made to the algorithm to provide better behavior in this case? 7. If you were required to sort a very large file that would not fit in memory, what algorithm would you choose? Describe the steps you would perform to sort the file