Suppose we use a hash function h to hash n distinct keys into an array T of length m. Assuming simple uniform hashing, what is the expected number of collisions? More precisely, what is the expected cardinality of {{k, l} : k 6= l and h(k) = h(l)}?

See attached pictures.

Explanation:

See attached pictures for detailed explanation.

If ana decided to be against in prioritizing the task in her to do list, she will likely have insufficient time in doing the things in which she wouldn't be able to finish and in the same way, she won't be able to finish all of the task that she needed to do.