Which statement best describes both an advantage and a disadvantage of Insertion Sort?

1. AFastest sorting algorithm for all inputs but requires excessive auxiliary space, making it unsuitable for memory-limited systems.
2. BEfficient for nearly sorted data due to adaptability but impractical for large datasets due to O(n2) complexity.
3. CPerforms optimally for any input type but lacks stability, failing to preserve the relative order of identical elements.
4. DGuarantees logarithmic time for sorted inputs but remains inefficient for small datasets as its complexity stays O(n2).