PLEASE COMPLETE ALL PARTS IN JAVA

PLEASE COMPLETE ALL PARTS IN JAVA

PLEASE COMPLETE ALL PARTS IN JAVA

PART 1

PART 2

PART 3

PART 4

PART 5

We have declared a method called merge Sorted with two int[] parameters sortedNums 1 and sortedNums. You can assume sortedNums 1 and sortedNums2 are non-empty and are already sorted in ascending (i.e., increasing) order. TASK: Fill in the body of the merge Sorted method such that it will return a sorted int[] containing all the elements of sortedNums1 and sortedNums2 (including duplicate elements). Sample Input: 1 3 5 7 2 4 6 8 Sample Output: 1 2 3 4 5 6 7 8 Write a program, test using stdin stdout Time limit: 8 seconds Memory limit: 256 MB 1 static int[] merge Sorted(int[] sortedNums1, int[] sortedNums2) { 2 1/ YOUR CODE HERE 3 ) We have declared a method called addSorted with one ArrayList parameter sortedNums and one int parameter new Num. You can assume sortedNums is non-empty and is already sorted in ascending (i.e., increasing) order. TASK: Fill in the body of the addSorted method such that it will add newNum to sortedNums while maintaining sorted order. Sample Input: 1 3 4 5 Sample Output: 1 2 3 4 5 Write a program, test using stdinstdout Time limit: 8 seconds Memory limit: 256 MB 1 static void addSorted(ArrayList sortedNums, int newNum) { 2 1/ YOUR CODE HERE 3} We have declared a method called removeEvenNums with one ArrayList parameter nums. TASK: Fill in the body of the removeEvenNums method such that it will remove all even numbers from nums (all remaining items must be in their original order). Your method should not return a new ArrayList - it should modify the parameter nums in place. Sample Input: 1 2 3 4 5 Sample Output: 135 Write a program, test using stdin stdout Time limit: 8 seconds Memory limit: 256 MB 1 static void remove EvenNums(ArrayList nums) { 2 // YOUR CODE HERE 3} We have declared a method called computePrimes with one int parameter num. TASK: Fill in the body of the computePrimes method such that it will return an ArrayList containing the prime numbers less than or equal to num. You may assume that num is greater than 1. HINT: Recall that a number is considered "prime" if it is only divisible by 1 and itself. HINT: 1 is not a prime number. HINT: You can use Math.sqrt(x) to take the square root of a variable x. No need to import anything: we've done that for you behind-the- scenes. It is possible to solve this problem without using the sqrt method, but it will allow you to test if a number is prime much more efficiently Sample Input: 10 Sample Output: 2 3 5 7 Write a program, test using stdin stdout Time limit: 8 seconds Memory limit: 256 MB 1 static ArrayList computePrimes(int num) { 2 // YOUR CODE HERE 3} We have declared a method called products with one int parameter n. TASK: Fill in the body of the products method such that it will return an int[][] with n rows and n columns (i.e., n-by-n) in which the i-th row of the j-th column contains the product (i+1)*(1+1). EXAMPLE: products (4)[0][0] is 1*1=1, and products(4)[3][3] is 4*4=16. Sample Input: Sample Output: 1 2 2 4 3 6 4 8 5 10 3 6 9 12 15 4 8 12 16 20 5 10 15 20 25 1 Write a program, test using stdin stdout Time limit: 8 seconds Memory limit: 256 MB 1 static intl products(int n) { 2 // YOUR CODE HERE 3}