the integers n satisfying $1<=$n$<=25$ are arrange in a square array of five rows and five columns in an arbitrary way. The greatest memeber of each row is selected, and s denotes the least of these. Similarly, the least member in each column is selected, and t denotes the greatest of these. Show that s$>=$t$,$ and give an example in which s $!=$ t$.$