Link to question: http://codecheck.it/files?repo=fall2017&problem=q1

Implement a method to swap the smallest and largest element in an array of integers. If there are multiple occurrences of the smallest element, replace the leftmost one. If there are multiple occurrences of the largest element, replace the rightmost one.

For example, if the array contains

1 2 9 2 1 9 3 

then you should swap the leftmost 1 and the rightmost 9 to yield

9 2 9 2 1 1 3 

Complete the following file:

Arrays.java

public class Arrays { public static void swapLargestAndSmallest(int[] a) { } }