Let you have an array $S[1 \dots n]$ and a function $reverse(s,i,j)$ which reverse the order of elements in $s$ between $i,j$-th positions. What does the following sequence do where $1\leq k\leq n$ ;
reverse(s,1,k)
reverse (s,1,n)
reverse(s,k+1,n)
- rotate s by k position to left
- leaves s unchanged
- rotate s by k position to right
- none