A permutation over alphabet Σ=(1,2,3,…,n) is a sequence over Σ, where every element occurs exactly once. Sn denotes symmetric group defined over Σ. In=(1,2,3,…,n)∈Sn denotes the Identity permutation. Rn∈Sn is the reverse permutation i.e., Rn=(n,n−1,n−2,…,2,1). An operation, that we call as an LE operation, has been defined which consists of exactly two generators: set-rotate that we call Rotate and pair-exchange that we call Exchange (OEIS). At least two generators are the required to generate Sn. Rotate rotates all elements to the left (moves leftmost element to the right end) and Exchange is the pair-wise exchange of the two leftmost elements. The optimum number of moves for transforming Rn into In with LE operation are known for n≤10; as listed in OEIS with identity A048200. However, no general upper bound is known. The contributions of this article are: (a) a novel upper bound for the number of moves required to sort Rn with LE has been derived; (b) the optimum number of moves to sort the next larger Rn i.e., R11 has been computed; (c) an algorithm conjectured to compute the optimum number of moves to sort a given Rn has been designed.