Please use rule of thumb for this question $?$ Selection sort takes time $($rougly$)$ proportional to n$^2$ while merge sort takes time $($roughly$)$ proportional to nlogn$,$ where n is the array size. Suppose that both algorithms take the same amount of time to sort an array of size $100.$ What will be the ratio of the runtimes selection sort $/$ merge sort when the array size is increased to$?$