Given an array of integers, return the largest gap between the sorted elements of the array. For example, consider the array: [9, 4, 26, 26, 0, 0, 5, 20, 6, 25, 5] ... in which, after sorting, the array becomes: [0, 0, 4, 5, 5, 6, 9, 20, 25, 26, 26] ... so that we now see that the largest gap in the array is between 9 and 20 which is 11 Examples largestGap ([9, 4, 26, 26, 0, 0, 5, 20, 6, 25, 5]) → 11 // After sorting: [0, 0, 4, 5, 5, 6, 9, 20, 25, 26, 26] // Largest gap between 9 and 20 is 11

in java ecplise . Implement a program that randomly generates 10 integers from -100 to 100,stores them in a 1D array, and finds their maximum value. Calculate theexecution time of finding a maximum. Repeat the test for 10,000 and10,000,000 numbers. Provide your results in the form of a table below andprovide a small summary. Implement a Java program that will populate a 5x5 matrix with randomlygenerated integers from 0 to 100.(1) print your matrix in a table form.(2) modify your code to multiply all even numbers by 10 and print the matrix.Your output of questions (1) and (2) should match the format of the followingsample outputs:

Help only for b and c, not question a

A Queen on a chessboard can attack any piece in the same column, row or diagonal. The N-Queens problem is to place n queens on an x n chessboard such that no two queens threaten each other. a) Implement a one-dimensional integer array of Queen positions for an 8x8 board where indices represent rows and the values represent columns. For example, a "safe" solution would be (3,6,2, 7, 1, 4, 0,5} b) Implement a print function to display the board (see output example) c) Implement an isSafe function that: 1) Returns false if multiple queens share a column 2) Returns false if multiple queens share a diagonal 3) Returns true if all queens are safe d) Program should display if the Queens are safe or not safe. Example Output Testing: 1 4 2 3 5 7 60 Queens are not safe!