write java code

D2L Bright space Instructor: Rongxing Lu The marking scheme is shown in the left margin and [100] constitutes full marks. [60] I. Given an integer array A {3, 6, 10, 18, 8,7,25,40), [20] (a) Write your own Java source code named Mergesort. ava to implement Merge Sort algorithm on the array A. Please finish your code in the following template, where "XXXSort" is replaced with "MergeSort". [20] (b) Write your own Java source code named HeapSort. j ava to implement Heap Sort algorithm on the array A. Please also finish your code in the following template, where "XXXSort" is replaced with "HeapSort". [20] (c) Write your own Java source code named Quicksort. ava to implement Quick Sort algorithm on the array A. Please also finish your code in the following template. where "XXXSort" is re- placed with "QuickSort". public class XXXSort