solve in java Given the integer array averageMiles with the size of NUM_ELEMENTS, write a for loop to output the integers in the first half of averageMiles in reverse order. Separate the integers with a dash surrounded by spaces (" - "). Ex: If the input is 75 84 39 85 115 118 48 50, then the output is: 85 - 39 - 84 - 75 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20         import java.util.Scanner;   public class MileData { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_ELEMENTS=8; int[] averageMiles=newint[NUM_ELEMENTS]; inti;   for (i=0; i<averageMiles.length; ++i) { averageMiles[i] =scnr.nextInt(); }   for (/* Your code goes here */) { /* Your code goes here */ }   System.out.println(); } }

I could really use some help with a problem I got for coding. A screenshot showing an example would help.

write the java program

1. Declare an array to hold eight integers. Use a for loop to add eight random integers, all in the range from 50 to 100, inclusive, to this array. Duplicates are okay. Next, pass the array to a method that sorts the array and returns another array containing only the largest and smallest elements in the original array. Print these two values in main. Then use a foreach loop to display all elements of the sorted array on one line separated by a single space. This latter loop should also count the odd and even numbers in the array and determine the sum of all elements in the array. SAMPLE OUTPUT The lowest element is 59 The highest element is 96 Here is the array 59 64 76 77 80 88 91 96 Evens: 5, odds: 3 Total: 631

I need help with creating a Java program described below: Minesweeper.Write a program that reads three numbers, m, n, and p and produces an m-by-n Booleanarray where each element is occupied with probability p. In the minesweeper game, occupiedcells represent bombs and empty cells represent safe cells.Print out the array using an asterisk for bombs and a period for safe cells.Then, create an integer two-dimensional array with the number of neighboring bombs (above,below, left, right, or diagonal). * * . . . * * 1 0 0. . . . . 3 3 2 0 0 . * . . . 1 * 1 0 0Write your code so that you have as few special cases as possible to deal with, by using an(m+2)-by-(n+2) Boolean array.

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below.             The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std;   // Global constants const int ROWS = 3;  // The number of rows in the array const int COLS = 3;  // The number of columns in the array const int MIN = 1;  // The value of the smallest number const int MAX = 9;  // The value of the largest number //…

Given an array arr of type int, along with two int variables i and j, write some code that swaps the values of arr[i] and arr[j]. Declare any additional variables as necessary.