write a recurrence relation describing the running time of algorithm modified merge sort(A, p,r) include base case.

Consider sorting an unsorted array A, are merge sort and quick sort stable? Circle your answer below Insertion Sort                  Stable                 Unstable Merge Sort                      Stable                 Unstable Quick Sort                       Stable                 Unstable Counting Sort                 Stable                 Unstable Radix Sort                       Stable                 Unstable

Please, answer and provide an explenation.

Using Java, 1. Implement external sort: for sort phase use normal sort,   for merge phase use two way merge to merge n sorted files (merge2way(n)), for array sort use heapsort. Also write merge(f1, f2, f3) to merge two sorted files f1 and f2 into f3.. Write mergenway(n) method and print execution time of both merges for initial input file over 10MB data.  A sample input is as follow:Note:Fist input is max array size for sort           10   84   82   52   80   96   85   75   75   82   87  92   89   57   94   93   92   63   99   87  72   73   56   74   50   84   62   72   55   86   75  74  100   83   60   53   68   89   67  66  65   72   94   73   54   98   96   85   75   75   82   87  92   89