You are given an array s$[]$ of length n and a procedure reverse$($s$,$ i$,$ j$)$ which reverses the

order of elements in s between indices i and j $($both inclusive$).$ The following three lines of

code are written to rotate s left by n$-$k positions. Find the missing arguments in the function

calls. Explain the solution with an example array s$=[10,20,30,40,50,60,70,80].$

Indexing starts from $1.$

reverse$($s$,?,?)$;

reverse$($s$,?,?)$;

reverse$($s$,?,?)$;