(1) Run your project on the commands in the file commands.big (which is in
    the same directory as this questions file) for the following cases:

      - d = 2
      - d = 4
      - d = 8
      - d = 16

    The command file will insert 100,000 numbers and print out the total
    CPU time used after every 1000 inserts.  Does the value of d seem to
    have an impact on asymptotic performance of insert?  If so, what is the
    observed effect and why does it occur?  If not, why not?

(2) Rather than performing find() in a heap by searching linearly through
    the heap, you could use a hash table to store the location of each
    value in the heap.  Describe (in a couple of paragraphs) how this would
    work and the problems that might arise.  What would be the impact of
    this change on the performance of your project (i.e. the various
    d-ary heap methods) both in terms of time and space complexity?