C++ hash equivalence

Someone help me on this quiz problem i have: I need it in couple of hours and it needs to be done in gcc++11 version 4.8. 3. (13 pts) Modify my solution to the HashEquivalence class so that in every call to compress_to_root it records the information needed for computing the following: (a) the maximum size of compress_set (including all calls to compress_to_root); (b) a histogram storing the number of times each different compress_set size (between 0 and that maximum) appears; (c) the total number of calls to compress_to_root; (d) the average size of compress_set (including all calls to compress_to_root). Also modify show_equivalence in HashEquivalence to NOT print the maps it currently prints, but instead print (a) the maximum size of compress_set, (b) the histogram of its sizes, (c) the total number of calls to compress_to_root, and (d) and the average size of compress_set (including all calls to compress_to_root). Finally, modify empirical_equivalence to call show_equivalence at the end of the outer for loop. Use the information collected to fill in the table below, when running with 200,000 singletons and 1 for test_times and 1 for merge_factor. Fill in only those lines 0 to the maximum size of compress_set (the maximum should be no bigger than 10). Although running empirical_equivalence uses random numbers, the numbers produced for the table below should all be similar. Hints: add some local variables (I used a HashMap<int,int> for the histogram) to the HashEquivalence class and write code in compress_to_root and show_equivalence to process these variable.