What is mean by stable sorting algorithm?

• A. A sorting algorithm is stable if it doesn’t preserve the order of duplicate keys
• B. A sorting algorithm is stable if it preserves the order of duplicate keys
• C. A sorting algorithm is stable if it preserves the order of all keys
• D. A sorting algorithm is stable if it preserves the order of non-duplicate keys