Suppose we are sorting an array of n $3$s followed by n $0$s when n is large. Instead of insertion sort we use a reduced version of shell sort with stride lengths of $3$ and $1.$ Approximately how much faster is this than insertion sort?