Which of the following describes the time complexity and stability of Insertion Sort?
A. Worst - O(n^2), Average - O(n^2), Best - O(n), Stable, In-Place
B. Worst - O(n^2), Average - O(n^2), Best - O(n^2), Stable, Not In-Place
C. Worst - O(n log n), Average - O(n log n), Best - O(n), Stable, In-Place
D. Worst - O(n log n), Average - O(n^2), Best - O(n), Stable, In-Place
