Write a function that performs a given number of right circular rotations-each performed from index L to index R and specified as an input parameter -- and returns the value at the given index of the array after all rotations have been performed. Please add your code to problem2.h and problem2.cpp as provided. Input arr[l: (1, 2, 3, 4, 5h ranges i to, 21, te, 3) > index1 Output 3 Explanation After first given rotation 0, 2 arr[] -13, 1, 2, 4, 51 After second rotation 0, 3 arr4, 3, 1, 2, 5 After all rotations we have element 3 at given index 1