Your job is to: 1) implement the one algorithm in these files that is not alr

 
Your job is to:
1) implement the one algorithm in these files that is not already implemented (merge sort),
2) Tell me in a comment in your code three things:
what the runtime of this algorithm is
whether it is “destructive”
whether it is “in-place”
3) submit timing data along with your code to show that your code actually has the runtime you claim it does.
Your submission will be:
– A zipped copy of all the files I’m providing, with the unimplemented algorithm implemented and the comments attached to taht algorithm indicating its properties (see above).
– And, in your zip file, you should include some kind of graph showing the growth of the runtime of your implementation of the algorithm, as determined by running it under different conditions and timing it, along with the raw timing data you used to make the graph.You can make the graph however you like (hand-drawn is fine).