HW3 Sp18 (2) Compatibility Mode Saved Leslie Nebiyu Design Layout References Mailings Review View Help PDF Pro 10 FOXIT PDF Tell me whot you want Nrmal1 No Spac Heading 1 Heading 2 Font Paragraph Styles Programming Assignment You are asked to implement the merge sort and quick sort algorithms for an array of integers and then perform the measurements as detailed For each algorithm, implement the functions that take an array of integers and the size of the array and then sort it in ascending order. Add counters to count the number of key comparisons and the number of data moves during sorting. For the quick sort algorithm, you are supposed to take the first element of the array as the 2 pivot. Write a main function to measure the time required by each sorting algorithm. To this end, use the library function clockO. which is defined in time.h. Invoke the clock0 library function before and after each sorting algorithm to measure the elapsed time in milliseconds. Implementations 1 Put the implementations of these functions in sorting.cpp, and their interfaces in sorting.h. Do not include your main function in these files. Submit your main function inside a separate file, called main.cpp. After implementing the sorting algorithms, I Create two identical arrays with num-random 1000 integers using the random number generator function rand