Can you please solve this problem in JAVA

Given a word, a rotation is found by moving one letter from the head to the tail of the word. For example, the word 'orange' rotated once is 'rangeo', rotated twice is 'angeor', rotated thrice is 'ngeora'. Function Description Write a method rotate (s,n) that takes two arguments, a string S and an int n, that rotates a given string s,n times. Constraints - s is a string - n is an integer >0 - You have to use a loop in your solution 7. Rotate a string Given a word, a rotation is found by moving one letter from the head to the tail of the word. For example, the word 'orange' rotated once is 'rangeo', rotated twice is 'angeor', rotated thrice is 'ngeora'. Function Description Write a method rotate (s,n) that takes two arguments, a string S and an int n, that rotates a given string s,n times. Constraints - s is a string - n is an integer >0 - You have to use a loop in your solution