Write a Java program to solve the following problem using modularity. Write a method that rotates a one-dimensional array with one position to the right in such a way that the last element becomes the first element. Your program will invoke methods to initialize the array (random values between 1 and 15) print the array before the rotation, rotate the array, and then print the array after rotation. Use dynamic arrays and ask the user for the array size. Write your program so that it will generate output similar to the sample output below:

How many arrays to rotate right?

-3

ERROR!Should be positive.

REENTER: 3

Enter array size: 8

The array before rotation:

8 15 2 10 11 15 1 3

The array after rotation:

3 8 15 2 10 11 15 1

Enter array size: 5

The array before rotation:

13 9 14 7 15

The array after rotation:

15 13 9 14 7