Data structures and Algorithms Problems involving sorting and inversion count using two different approaches

A description of these two problems is as follows: 1. The first problem involves a file that contains all of the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated. Your task is to write code to compute the number of inversions in the file given where the ith row of the file indicates the ith entry of an array. For this problem you should use Mergesort algorithm and apply it on the file [login to view URL] file. 2. For the second part you will be using Quicksort algorithm and applying it on [login to view URL] file. Your task is to compute the total number of comparisons used to sort the given input file. You will be graded on logic, comments, whether the code runs or not and the output. Need all the source code files (.py, or .java, or .c or .c++) and also Please add a README file to include any instructions on how to successfully run your code if there are any specific steps.