KURSCHAK 2006 Problem 2

Let $a,t,n$ be positive integers such that $a\le n$ . Consider the subsets of $\{1,2,\dots,n\}$ whose any two elements differ by at least $t$ . Prove that the number of such subsets not containing $a$ is at most $t^2$ times the number of those that do contain $a$ .