Suppose we have two computers, computer A$,$ a fast computer running insertion sort. Computer B$,$ a slow computer running merge sort. Each must sort an array of $100$ million numbers. Suppose that computer A executes $100$ billion instructions per second and computer B executes $100$ million instructions per second. Suppose Computer A requires $5$n square instructions to sort n numbers and computer B requires $100$nlgn instructions to sort the n numbers. Find the time it takes the two computers to sort the $100$ million numbers