Write a recursive function called reverse such that, given a string s$,$ prints the characters of s in reverse order

no credit if your solution is not recursive

HINTS

in python, if ss the String "abcde":

ss$[0$:$5]$ is "abcde"

ss$[0$:$4]$ is "abcd"

ss$[0$:$3]$ is "abc"

ss$[1$:$5]$ is "bcde"

ss$[2$:$5]$ is "cde"

ss$[3$:$5]$ is $"$de$"$

also

ss$[0]$ is $"$a$"$

ss$[1]$ is $"$b$"$

ss$[4]$ is $"$e$"$

Examples:

$\%$ python$3$ reverseString.py

enter a string:

$\%$ python$3$ reverseString.py

enter a string: $1$

$\%$ python$3$ reverseString.py

enter a string: $12$

$21$

$\%$ python$3$ reverseString.py

enter a string: $1234567890$

$0987654321$

$\%$ python$3$ reverseString.py

enter a string: abced

decba

$\%$