I dont understand how to implement it using java can you help ? thanks. the pswedocode.

only java implementation following pswedocode

merge sort recursive following pswedocode.

Algorithmic Development Question 1 Let's start by implementing a version of the Merge Sort algorithm (using the pseudo-code below) that sort values in ascending order. Merge Sort divides the input array into 2 parts. There are 2 main components to the function merge() and sorto "review your lecture notes if you need to refresh your memory Your merge function assumes the input arrays are sorted and then merges them into one array The sont function is a recursive call that divides the array down and down until it reaches the base case and then sorts as it retums. First implement merge (pseudocode): Function merge(array a, array aux, int lo, int mid, int hi){ Wcopy the array a to an aux array For loop through k{ Aux[k] = a[ki] Imerge back to all I = lo J = id+1 For loop to merge al back { linsert your code here) Second implement the recursive sort (pseudocode): Function sort (array( array, int I, intrX If (I