i What is the smallest list input size $\backslash ($ n $\backslash )($whole number$)$ which ensures that, for any larger $\backslash ($ n $\backslash )$ and worst case list per method, Larry's computer sorts faster than Moe's?

ii What is the smallest list input size $\backslash ($ n $\backslash )($whole number$)$ which ensures that, for any larger $\backslash ($ n $\backslash )$ and worst case list per method, Curly's computer sorts faster than Moe's?

iii What is the smallest list input size $\backslash ($ n $\backslash )($whole number$)$ which ensures that, for any larger $\backslash ($ n $\backslash )$ and worst case list per method, Curly's computer sorts faster than Larry's?