Merge is a method used to merge two sorted arrays into one sorted array. It takes two integer  arrays as inputs and returns an integer array. Implement the merge method     public static int[] merge(int[] a, int[] b) {         return new int[] {-1};     }   * must be in this layout and written in java

Heapsort has heapified an array to: 76 62 40 32 30 and is about to start the second for loop. What is the array after each loop iteration? i= 4: Ex: 86, 75, 30 i = 3: i = 2: i= 1:

Heapsort has heapified an array to: 63 50 37 26 89 and is about to start the second for loop. What is the array after each loop iteration? i = 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1:

Task - 2: Write a java program (AnyTypeMergeSort.java) to implement the Merge Sort algorithm to sort the array containing any type of elements (suppose strings). Your program will have the following method signature: ● ● public void mergeSort(T[] A, int lowerBound, int upperBound) public void merge(T[] A, int lowerBound, int midPoint, int upperBound) Following is the Merge Sort Algorithm MERGE-SORT (A, p,r) 1 if p≥r 2 3 4 5 6 // Merge A[p:q] and A[q + 1:r] into A[p:r]. 7 MERGE(A, p, q, r) 4 Where p and r represent lower (starting index) and upper (ending index) bounds of array A respectively. The Merge Sort calls the following Merge Algorithm that accepts q as the mid of the array along with p and r: MERGE(A, p, q, r) 1 n₂ = q-p+1 2 nR=r-9 3 let L[0:n 5 6 7 8 9 10 11 return ANZEIGEN q = [(p+r)/2] MERGE-SORT(A, p, q) MERGE-SORT (A, q + 1,r) 22 25 26 27 i = 0 j = 0 k = p 12 13 14 15 16 17 18 19 // Having gone through one of L and R entirely, copy the // remainder of the other to the end…

Write the code in java and please dont use AI or copy from other sources. Write it on your own and write what the sample and question says

Refer to the following method that finds the smallest value in an array. /** Precondition: arr is initialized with int values. * Oparam arr the array to be processed Greturn the smallest value in arr public static int findMin(int[] arr) { int min = /* some value */; int index = 0; while (index < arr.length) { if (arr [index] < min) min = arr [index]; index++; } return min; } Which replacement(s) for /* some value */ will always result in correct execu- tion of the findMin method? I Integer.MIN_VALUE II Integer.MAX_VALUE III arr [0] (A) I only (B) II only (C) III only (D) I and III only (E) II and III only

Heapsort has heapified an array to: 96 71 57 36 25 and is about to start the second for loop. What is the array after each loop iteration? i= 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1:

Java -  This project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select.  You will implement the following:   Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research)   General rules: Structures can be static or dynamic You are not allowed to use built in methods that are direct or indirect requirements for this project – You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares) Your program will be sorting names – you need at least 100 unique names (you can use the 50 given in project #3) – read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed. All sorts will be from…

In Java, Apply replacement selection sort to the following list assuming array size M = 3; 27 47 35 7 67 21 32 18 24 20 12 8 Show the content of each sorted file.

Paragraph Styles Editing 5. Given the following series of n integers:1+2+3++n-2+n-1+nWrite a Java method that returns the sum of the series. 6. Given the following function:f(x)-2xFor, determine 7. Consider an array that stores the following sequence of integers:10, 15, 20, 25, 30Write a Java method that returns the sum of the integers stored in the array. The array must be passed to the method as an argument. I OFocus E