in C++ Need help with this please and i need the output capture to look the same.

Hands-on Exercise #4: Sorting Algorithms 1. Add a counter to the functions inaeztienSort and merge Sext that counts the number of comparisons that are made Run two functions with arrays of various sizes. At what size does the difference in the number of comparisons between significant? How does this size that the orders of these algorithms predict? Compare your analysis with the actual running times and counter as a function of the input size 24,8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8192, 16384. Stime b> and clock() function.) Use the below code to generate an array value for testing. Lokant 1 - 0 1 <>