10. What is the total number of companions required to merge 4 sorted files containing 15, 3, 9 and 8 records into a single sorted file? 11. Which sorting algorithms does not have a worst-case running time of O(n2)? 12. State and explain the complexity of searching an element from a set of n elements using Binary search algorithm.