Answer to Question #39537 in C++ for koyel

Question

a) Write a procedure which implements recursive Mergesort on a given
array of Items, using normal order (not bitonic) for merge without sentinels.
Your extra space usage must be Θ(n) for input size n.

b) Write a procedure which implements recursive Mergesort on a given
array of Items, using bitonic order for merge, of course, without sentinels.
Your extra space usage must be Θ(n) for input size n.
we have to solve the following using c++