String Reverse

Chef has a string $S$ consisting only of English lowercase letters (`a` - `z`). However, Hitesh does not like it and wants it to be reversed. Hitesh wonders what is the minimum number of operations required to reverse the string $S$ using the following operation: - Select any $i$ such that $1 \le i \le \lvert S \rvert$ and remove $S_i$ from its original position and append it to the end of the st