Reverser Function using Recursion

[fbhkhan]

So i have a program it works which takes in a word reverses it prints it out. BUT! the problem is that the program is without recursion. I need help to convert the function into recursion. Please give me some idea or let me know the syntax if you were able to figure it out.

#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <cstring>

using namespace std;


void Reverse (char *);

int main()
{
    // define array for letters in a word entered
    char word[41];
    
    // ask user for input
    cout << "Enter a word" << endl;
    cin >> word;

    
    Reverse(word);
    
    cout << endl;
    
    system("Pause");
    return 0;
}


void Reverse (char *sentencePtr)

{
    
    char *p = sentencePtr;
    while ( *p != '\0' )
        
        ++p;
    
    while ( p != sentencePtr )
        
        cout.put ( *--p );
    
    
}

[JLBorges]

#include <iostream>

void print_reverse( const char* cstr )
{
    if( cstr != nullptr && *cstr != 0 ) // if the first character is not a null character
    {
        const char head = *cstr ; // first character
        const char* tail = cstr+1 ; // rest of the string

        print_reverse(tail) ; // first print the rest of the string in reverse
        std::cout << head ; // and then at the end, print the first character
    }
}

[fbhkhan]

@JLBorges Thank you so much!!