How to solve this on C++?

Exercise #2: Location of Target Write a function named "location of target" that takes as its arguments the following: . a one dimensional array of integer values an integer that tells how many integer values are in the array .an integer "target value" The function should determine whether the given target value occurs in any of the cells of the array, and if it does, the function should return the subscript (index) of the cell containing the target value. If more than one of the cells contains the target value, then the function should return the largest subscript of the cells that contain the target value. If the target value does not occur in any of the cells, then the function should return the sentinel value -1. Thus, for example, if the target value that's passed to the function is 34 and the array that's passed to the function looks like this: 5826 91 34 70 3488 then the target value occurs in cells 3 and 5, so the function should return the integer value 5 Sample input/ output: The rightmost location of the target is: 5 2/4