consider the following recursive algorithm restring.

Inputs: s$,$ a string

restring$($s$)($s$)\{$

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

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

$3.$ remove c from s

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

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

$6.$ return$($s$)$

$\}$

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