Add a counter to the functions insertion Sort and merge Sort that counts the number of comparisons that are made. Run the two functions with arrays of various sizes. At what size does the difference in the number of comparisons become significant? How does this size compare with the size that the orders of these algorithms predict?