Traditionally, merge sort is O(n log n) for space complexity?due to its divide-and-conquer nature. Is it possible to subvert this and do merge sort?in place instead? Request A Fresh Paper Done For You!You are guaranteed plagiarism free paper within 3-8 hrs About the author classhelp24@gmail.com [email if you need fresh paper done]