1. Give a big-Oh characterization, in terms of n, of the running time of following methods. 1 /** Returns the maximum value of a nonempty array of numbers. */ 2 public static double arrayMax(double[ ] data) { 3 int n = data.length; 4 5 6 1 2 3 4 5 6 7 8 9} 2. Give a big-Oh characterization, in terms of n, of the running time of following methods. 7 8 10 11 double current Max = data[0]; for (int j=1; j current Max) currentMax = data[j]; return current Max; } DBD2E2D /** Returns the sum of the integers in given array. */ public static int example1(int[] arr) { int n = arr.length, total = 0; for (int j=0; j

Answer the given question with a proper explanation and step-by-step solution. Given an array of integer 'nums' produce an array of integers composed of the absolute values of all the nunbers in 'nums'   public int[] getArrayAbs(int[] nums) {   return; }

Java program In main method: Create 2-D Array, called m: the row size of array m is 15 ask user to input column size of array m fill all array elements as double numbers in the range of (7.0, 17.0) by using random object create 2-d array, called double [][]md = {{1,1,1},{2,0,1},{4,7,4}}; pass the above array m and md to call the following two methods MaxCol(m); MaxCol(md); System.out.println (“the average of array m is: ” + returnLast3RowAvg(m)); System.out.println (“the average of array md is: ” + returnLast3RowAvg(md)); Print out the largest column sum, and the average of the last 3 rows of array m and md. In MaxCol(double[][]array) method, find and print the largest column sum in the array. In returnLast3RowAvg(double[][]array) method, find the average of the elements in the last 3 rows in the array and return this average value.

A method to make an almost sorted array into fully sorted.@param arr: an array of integers, with all the numbers are sortedexcepted the last one@param size: the number of elements in an array*/public static void insertLast(int[] arr, int size){// your work}To make it concrete, let's use the example shown in Figure 1. In this example, the arraycontains [1, 3, 4, 5, 6, 7, 2], and the size of the array is 7. As we can see, The inputarray are sorted excepted the last one. The goal here is to place last element into a correctposition so all numbers will be sorted. This is exactly what the method insertLast is toperform.1Figure 1: Sampel output for insertion sort part 1.As we recall from the lecture, the idea is keep shifting all larger number (compared with thelast number) to the right until we nd the number is smaller than the last number. In ourexample,1. Compare 7 with 2. Since 7 > 2, we copy 7 to its right.2. Compare 6 with 2. Since 6 > 2, we copy 6 to its right.3. Compare 5 with…