A hash function h hashes n distinct keys into an array T of m elements. Assuming simple uniform hashing, what is the expected number of collisions, that is$,$ the expected value of $|\{\{$k$,$ l$\}|$k $6=$ l and h$($k$)=$ h$($l$)\}|.$