What will do the following method?public void dosomething $($int x$)\{$if $($top $==-1)\{$system$.$out.print.In$("$Stack is empty"$)$;return;x $=\backslash$times $\%($top $+1)$;for $($int i $=0$; i rotations; i$+*)\{$int temp $=$ arr $[0]$;for $($int j $=0$; j top; j#$)\{$arr$[$j$]=$ arr$[$j $+1]$;$)$arr $[$top$]=$ temp; A$.$ Rotate the stack elements in the left direction. B$.$ Remove duplicates from a given stack.O C$.$ Reverse the elements of a stack.O D$.$ Rotate the stack elements to the right direction.Clear my choice