Consider the following recursive algorithm restring.

Input: $s,$ a string

restring

if $s$ is the empty string, return $(s)$

let $c$ be the first character in $s$

remove $c$ from $s$

$s^{\text{'}}$:$=$restring$(s)$

$s$:$=string{s}^{\text{'}}$ with $c$ added to the end

return$(s)$

$\}$

Write down the output of restring$($Fayetteville$).$