c++

Write a recursive function that goes through a given string until it finds the first character in that string matching a character passed into the recursive function. Your function needs to start at position 0 in the string ( array of chars ) and go to the next position until the first matching character is found that matches the one passed to the function. If no match is found, return -1 and display not found otherwise, return the first position of the character that was found