This needs to be in C++

Problem2.cpp:

Problem2.h:

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[] : (1, 2, 3, 4, 5) ranges[], { {e, 2), {e, 3} } index1 Output 3 Explanation: After first given rotation (o, 2) arrl] (3, 1, 2, 4, 5h After second rotation (e, 3) arr[] - {4, 3, 1, 2, 5h After all rotations we have element 3 at given index 1. #include "problem2.h" 2 3 int findElement (int arr[], int ranges[2], int rotations, int index) 4 5 //write your code here 1 #ifndet LAB3 PROBLEM2 2 #define LAB3 PROBLEM2 3 int findElement (int [], int [1[2], int, int); 4 #endif