A left rotation operation on an array of size shifts each of the array's elements unit to the left. Given an integer, , rotate the array that many steps left and return the result.ExampleAfter rotations, .Function DescriptionComplete the rotateLeft function in the editor below.rotateLeft has the following parameters:int d: the amount to rotate byint arr[n]: the array to rotateReturnsint[n]: the rotated arrayInput FormatThe first line contains two space-separated integers that denote , the number of integers, and , the number of left rotations to perform.The second line contains space-separated integers that describe .ConstraintsSample Input5 41 2 3 4 5Sample Output5 1 2 3 4ExplanationTo perform left rotations, the array undergoes the following sequence of changes:

Implement a function that returns an updated array with 1 left rotation on an array of integersrotateLeft([1,2,3,4]) // returns [2,3,4,1]

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:[4,5,6,7,0,1,2] if it was rotated 4 times.[0,1,2,4,5,6,7] if it was rotated 7 times.Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-2]].Given the sorted rotated array nums of unique elements, return the minimum element of this array.You must write an algorithm that runs in O(log n) time.

Rotate an ArrayA group of students is working on a robotics project where a sensor array needs to be adjusted to avoid obstacles. They need a function to simulate rotating the sensor readings (an array of integers) to the right by a given number of positions.Write a function that rotates an array of integers to the right by a given number of positions.Constraints:NAExample:Input:51 2 3 4 51Output:5 1 2 3 4Explanation:Input:5  --->size of array1 2 3 4 5----->elements in array1 ---> number of shifts to be doneOutput:5 1 2 3 4  ---> array after rotating it by 1 step

public static List<Integer> rotateLeft(int d, List<Integer> arr) { int n = arr.size(); List<Integer> result = new ArrayList<>(n); for (int i = 0; i < n; i++) { int newIndex = (i + n - d) % n; result.add(arr.get(newIndex)); } return result; }}

RotationGiven an array Arr[] of N integers and a positive integer K. The task is to cyclically rotate the arrayclockwise by K.Note: Keep the first position of the array unaltered.Constraints:Constraints1 < N <=100-100 <= Arr[i] <=1001 <=K <=100Input format for testingThe candidate should write the code to accept the inputs separated by a new line.First Input: Accept a single positive integer value for N representing the size of Arr[]Second Input: Accept N number of integer values separated by a new line, as elements of Arr[]Third input: Accept a single positive integer value for K representing the number of rotations.Output format for testingThe output must be N integer numbers separated by a single space character.Additional messages in the output will result in the failure of test cases.Example:Input5 -- Value of N{10, 20, 30, 40, 50} -- Elements ofArr[]2 -- Value of KOutput40 50 10 20 30Explanation:Arr[] = {10, 20, 30, 40, 50} and K = 2 (Two cyclical rotations)After 1st rotation = {10, 50, 20, 30, 40}After 2nd rotation = {10, 40, 50, 20, 30}