Hi guys, I have to complete this question but I have no idea how to solve it, not even an inkling.

The question is

For each integer that n is greater than or equal to 1, prove (without induction) that:

(2^2n / 2n) is less than or equal to the set^{(}^{2n )(n)}which is less than 2^2n

(See attached thumbnail for much clearer version of question)

Thanks in advance for your help! (I hope)

Andrew