java program, the user provides as input an odd integer n. An integer array A[0 .. n−1] of size n is then allocated dynamically and initialised with A[i] = 0 for every index i. The program then reads integer inputs provided by the user. As long as these inputs are between 0 and n−1 (including the two numbers), the program continues to accept more integers in a loop. Every time an input i is provided, the program does A[i]++. The number of integers between 0 and n−1 that have been input by the user, is counted in an integer variable m. Once the program comes out of the loop, the program has to find the statistical mode of the numbers 0 to n−1 . (Mode is the number between 0 and n−1 that has occurred as an input the maximum number of times.) What additional steps will the program have to go through? which statement is true by following option, it can be more than one true answers.   A.Sort the array A[0..n − 1] in ascending order and report A[n − 1] as the mode.   B.The index i such that A[i] is at most n/2.

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

write a java-like pseudocode printing how many times integer x appears in an array. the array values are (1,2,1,3,1,1) and x=1.

Write a Java program with a single-dimension array that holds 10 integer numbers and identify the maximum value of the 10 numbers. Next sort the array using a bubble sort and display the array before and after sorting. Psuedocode Generate 10 random integer numbers between 1 and 100 place each random number in a different element of a single-dimension array Display the array's contents unsorted as they are generated Using the bubble sort, sort the array from smallest integer to the largest. //must use the following:    Bubble Sort Code:          public static void bubbleSort(int[] list)          {            int temp;                                               for (int i = list.length - 1; i > 0; i--)              {                 for (int j = 0; j < i; j++)                 {                   if (list[j] > list[j + 1])                   {                   temp = list[j];                   list[j] = list[j + 1];                   list[j + 1] = temp;                   }…