Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort? (Insight: You need to set up an equality and solve for the exact solutions of n. Find both the upper and lower values of n.)