$(1)$ Supposing that we store $n$ keys in a hash table with size of $n^2$ by a universal hash function, prove that the collision probability is less than $0\mathrm{.}5.$