Determine which computer will process the data below faster. Computer A running insertion sort against a slower computer B running merge sort. They each must sort an array of 50 million numbers. Suppose that computer A executes 10 billion instructions per second and computer B executes only 10 million instructions per second Computer A is 1000 times faster than computer B in raw computing power.

computer A code requires 2n2 instructions to sort n numbers. Suppose that merge sort, using a high-level language with an inefficient compiler, with the resulting code taking 50 nlogn instructions.