Suppose we used hash function H(n) to hash 'n' distinct elements (keys) into an array T of length 'm'. What is the expected number of colliding pairs of elements if we use simple uniform hashing?
a) theta(n2)
b)theta(m2)
c)theta(n2/m)
d)theta(n3/m2)
answer given is c, also some explanation is provided by them but I couldn't understand. please someone give and easy solution to this problem.