Increasing String

You are given a string $S$, consisting of lowercase English letters. You can do the following operation **at most once** : - Choose a subsequence of the string $S$, then remove it from $S$ and concatenate the subsequence at the end of the remaining string. Find the **lexicographically minimum string** that can be obtained by performing this operation **at most once** on $S$. Note that: - A s