Programming language: Java

Share code and screenshot

Write a method that takes in an array of characters and sorts them using the merge sort algorithm. Output the original array and the sorted array. Problem 3: Quick Sort [5] Write two methods: 1. Quick sort using the basic algorithm for choosing a pivot 2. Quick sort using the median-of-three method for finding a pivot Show the original array and the sorted array for both methods. Problem 4: Driver Program [5] Write a driver program that takes in data from a file, stores it in an array, sorts the array, and stores the data in another file. Use the provided .txt file for input. The program through sort the array three times. Once for each of the previous 3 sorting methods you have written. Make a copy of your previous methods but remove any print calls. Store the sorted arrays in three files: "merge_sort.txt" "quick_sort_basic.txt" "quick_sort_3.txt