Here, elements are shifted leftwards, and an element that is shifted "off the left end" is shifted into the rightmost

position. We have described a left rotation by $1$ position $($each element gets shifted by one spot$).$ One can generalize this

to a rotation in which each element moves $k$ spots to the left. An example with $k=2$ is shown above.

In a file called LeftRotate.java write a method called leftRotate $($int$[]$ A$)$ that performs left rotation and test it with at

least three different arrays $($of different sizes$),$ including int$[]A=\{1,4,9,16,25\}.$ The test arrays should be in main$().$

Following each test, print the resulting array to confirm that it was properly rotated.

Then, write a method called leftRotateByK $($int$[]$ A$,$ int k$)$ that achieves a left rotation of an integer array by $k$ positions,

where $k$ is a variable you can change in the program. Test it out for $k=2,k=3$ and $k=5$ using the same test data, including

int$[]A=\{1,4,9,16,25\}.$ Print the "before" and "after" arrays to show that it rotated correctly.