Solve the following problem without sorting:

Input: an $($unsorted$)$ array of distinct keys a$1,...,$ an and two indices $1<=$ i $<$ j $<=$ n

Output: all keys lying between the ith and jth statistic

A$)$ Describe a brute force solution using only loops and comparisons.