SS$($A$[0..$ n $1])$ :

if n $=2$ and A$[0]>$ A$[1]$

swap A$[0]$ $ A$[1]$

else if n $>2$

m $=$ d$2$n$/3$e

SS$($A$[0..$ m $1])$

SS$($A$[$n m $..$ n $1])$

SS$($A$[0..$ m $1])$

$($b$)$ Would SS still sort correctly if we replaced m $=$ d$2$n$/3$e with

m $=$ b$2$n$/3$c$?$ Justify your answer.

$($c$)$ State a recurrence $($including the base case$($s$))$ for the number of

comparisons executed by SS