Q:Question:1.Suppose we are comparing implementations of insertionsort and merge sort on the same machine. For inputs of size n,insertion sort runs in 8n2 steps, while merge sort runsin 64nlgn steps. For which values of n does insertion sort beatmerge sort? How might one rewrite the merge sort pesudocode to makeit even faster on small inputs?A:Answer:It can be easly find by putting the value of nfor ...