3. Recall, bubblesort takes time roughly proportional to the square of the in Startime roughly proportional to the square of the input size would we expect it to take to sort an array of size.. batiblesort takes 10ms to n 2,000? o te 10 - 107 how long use the bigger units if appropriate es seconds, hours or possibly days rather than millised 100? 10,0 A urort program is run on a replica of the 1945 ENIAC computer and an optimized slowwort program is run on 2000 desta orduterWhen orican array of size 1.000 using each setup we find optimized Slowort time to be just one one-millionth of the quicksort timeThats not too sumerising since the ENLAC processor speed is 100Hz 15.4GHz for the recent desktop. But does the faster hardware still win for leger array sees? Do the math to compare runtimes when we increase the array size to a) 1 million and b illion. That means calculate the new ratios lopt.soworte divided by quicksort time)