Write two methods, myCode() and helloWorld(String[] args).   The myCode() method must: 1. Create a String array with these elements: "Hello" "World" 2. Call helloWorld(String[] args) method, using the array you created as the parameter.   The helloWorld(String[] args) method must: 1. Replace the word "World" with the word "CityTech".

Attached. In Java, please. Short and executable.

The input to this method is supposedly an ArrayList of integers    that ranges from 1 to 100, however this is not exactly the case.    Sometimes, there will be gaps in the range for example, the range    could be: [1 2 ... 7 8 ... 99 100], with missing ranges in between.    Find all the missing numbers from the range, add them to an ArrayList,    return the ArrayList.------------------------ Below is my code that is failing. It is returning the correct missing numbers but is not going passed the last number  from the array. so [4,5,14,16,23,76,89] It is placing all of the missing numbers up to 88 when it should be going to 100 The solution should only return the missing numbers from 1-100. The original numbers from the given array should not be included in the return. How can I only return the missing numbers?  ------------------------ public ArrayList<Integer> solution(ArrayList<Integer> nums) {ArrayList<Integer> result = new ArrayList<Integer>();int count =…

A void method creates an integer array of size 12. The method then ask user to input these 12 numbers and store them in the array. Then print out all the numbers that are multiples of 3 and then print out all the numbers that are multiples of 4. Example: Input a number (1/12): 3 Input a number (2/12): 5 Input a number (3/12): 7 Input a number (4/12): 8 Input a number (5/12): 2 Input a number (6/12): 3 Input a number (7/12): 10 Input a number (8/12): 6 Input a number (9/12): 2 Input a number (10/12): 7 Input a number (11/12): 12 Input a number (12/12): 9 The multiples of 3 are: 3, 3, 6, 12, 9 The multiples of 4 are: 8, 12

Show your code and console with the exact sample run. Thankyou

You have an integer matrix representing a plot of land, where the value at that location represents the height above sea level. A value of zero indicates water. A pond is a region of water connected vertically, horizontally, or diagonally. The size of the pond is the total number of connected water cells. Write a method to compute the sizes of all ponds in the matrix.EXAMPLEInput:0 2 1 00 1 0 11 1 0 10 1 0 1Output: 2, 4, 1 (in any order)

This question is in javaYou are walking along a hiking trail. On this hiking trail, there is elevation marker at every kilometer. The elevation information is represented in an array of integers. For example, if the elevation array is [100, 50, 20, 30, 50, 40], that means at kilometer 0, the elevation is 100 meters; at kilometer 1, the elevation is 50 meters; at kilometer 2, the elevation is 20 meters; at kilometer 3, the elevation is 30 meters; at kilometer 4, the elevation is 50 meters; at kilometer 5, the elevation is 40 meters. a) Write a method called dangerousDescent that determines whether there is a downhill section in the hiking trail with a slope of more than -0.05. The slope is calculated by the rise in elevation over the run in distance. For example, the last kilometer section has a gradient of -0.01 because the rise in elevation is 40 - 50 = -10 meters. The distance covered in 1000 meters. -10 / 1000 = 0.01. Your method should return true if there exists a dangerous…

A "bunch" in an array is a consecutive chain of two or more adjacent elements of the same value. Write a method that returns the number of elements in the largest bunch found in the given array. Input: [1, 2, 2, 3, 4, 4, 4]   Output: 3 Explanation: There are two bunches here {2,2} and {4,4,4}. The largest bunch is {4,4,4} containing 3 elements so 3 is returned. Input: [1,1,2, 2, 1, 1,1,1] Output:4  Explanation: There are three bunches here {1,1} and {2,2} and {1,1,1,1}. The largest bunch is {1,1,1,1} containing 4 elements so 4 is returned.

For java. Refer to picture.

Question is in attatchment. Thanks!