In java please

* minPosition returns the position where the minimum value is located * Precondition: the array is nonempty and all elements are unique. * Your solution must go through the array exactly once * Here are some examples (using "=" informally): *

 *2minPosition(new double] 1, -4, 7, 7, 8, 11 1),11 -7 is is location 2 minPosition(new double] -7 1-7 is the minimum 0 == minPosition(new double[] { -13, -4, -7, 7, 8, 11 }) * // -13 is in location 0 6minPosition(new double] 1, -4, -7, 7, 8, 11, -9 b)11-9 is in location 6 * The code below is a stub version, you should replace the line of code *labeled TODO with code that achieves the above specification * 

public static int minPosition (double list) {