Assuming the array x has been defined as: int x[n]; for some n and that values have been assigned to all the elements. Write a segment of code that prints the number of elements between (but not including) the largest and smallest values in the array. Assume the largest and smallest values are unique (i.e., only appear once). For example, if the values of the array are: [15, 8, 12, 7, 2, 5, 11, 7, 17, 8, 13], then your code should print 3 because 2 is the smallest (at position 4) and 17 is the largest (at position 8), and there are three elements between, but not including those positions (i.e., elements at positions 5, 6 and 7. Do this using only one loop. This can be done with ONE for-loop