Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 5n2 steps, while merge sort runs in 100nlgn steps. For which values of n does insertion sort beat merge sort?

I would like to know how trial and error method works to find the n value to compare it with insertion sort in a detailed manner in theoretical format