What are the worst-case, average-case, and best-case time complexities of Quick Sort, and is it stable and in-place?
Option 1: Worst - O(n^2), Average - O(n log n), Best - O(n log n), Not Stable, In-Place
Option 2: Worst - O(n log n), Average - O(n log n), Best - O(n), Not Stable, In-Place
Option 3: Worst - O(n^2), Average - O(n^2), Best - O(n), Not Stable, Not In-Place
Option 4: Worst - O(n log n), Average - O(n log n), Best - O(n log n), Stable, In-Place
