Naive Algorithm – 2 (First Occurrence)

Given two strings, $P$ and $T$: $P$ is the pattern, and $T$ is the text where we will search for $P$ using a modified version of the naive search algorithm. In this algorithm, substrings of $T$ are traversed from left to right, while the characters of the strings are compared from right to left. During each character comparison, the character from $P$ being compared must be printed. After completing the search, print the starting position of $P$ in $T$, or print $0$ if $P$ does not appear in $T$.