C++

Write a function to reverse an array of integers starting from a given start index and a given end index. Note, the end index is inclusive.

int findElement(int arr[], int ranges[][2], int rotations, int index) {

code

}

Input arr[] 1, 2, 3, 4, 5) ranges[] - e, 2), se, 3) index 1 Output3 Explanation After first given rotation {e, 2 arr] (3, 1, 2, 4, 5) After second rotation te, 3) arr] 4, 3, 1, 2, 5) After all rotations we have element 3 at givern index 1