Assuming the string $s$ is not empty, what does the following recursive algorithm display?

show$($s string$)$

if $($s is empty$)$

return

else

print the first character of s

show$($the string beginning at the second character of s$)$

return

nothing

the first character of s a number of times equal to the length of s

the string s backwards

the string s