distanceBetweenMinAndMax returns difference between the minPosition and * the maxPosition in an array of doubles You can assume the array is nonempty and all elements are unique Your solution must go through the array exactly once. Here are some examples (usinginformally): *Spre = distanceBetweenMinAndMax(new double[] { -7 }) -7,-7 are the min and max 3 == distanceBetweenMinAndMax (new double[] { 1, -4, -7, 7, 8, 11 }), // -7,11 5 distanceBetweenMinAndMax (new doublet] -13, -4, -7, 7, 8, 11 j) // -13,11 . == distanceBetweenMinAndMax (new double[] { 1, -4, -7, 7, 8, 11, -9 }) // -9,11