Write an algorithm to find the product of the largest 3 numbers in the array (a1, a2, ..., a10) and outputs the result in the last position of the array. BE QUICK PLEASE I NEED THIS ASAP.

You can see in the above display, we first sort each row of the 2D array; we then take the transpose of a two D array, i.e., all the row elements becoming the column elements; we then sort each row of the 2D again. If you read the final array, each row is sorted; each column is also sorted. The smallest element obviously is the 1st element of the two D array and the last element is the largest element of a two D array. Let us now look at the following UML diagram: (Note that additional methods are allowed; proposed methods and instance variable cannot be changed)   Main method firstly constructs a 2D array of certain sizes and then construct a TwoD object and drive the task according to the above runtime interactions and displays. TwoD class has only one instance variable which is a two D array of numbers ( int or double). The constructor must do some “deep” copying.  A copy constructor. The other three methods are obvious in definition: to sort each row, to rotate the 2D array (i.e.,…

Solve by java

We need assistance with algorithm design.   Create an algorithm that, given an array of numbers, outputs a new array in which each number has an equal chance of appearing in each position.