#### \( p = 50 \)


10) To manage data sharing between threads using locks
Answer: 3 To manage function calls and local variables during program execution
Question: Which sorting algorithm uses a divide-and-conquer approach and has an average-case time complexity of O(n log n)?
1) Bubble Sort
2) Merge Sort
3) Insertion Sort
4) Selection Sort
5) Quick Sort
6) Linear Sort
7) Shell Sort