You are given a hash function which takes the modulo $100$ of a three digit integer search key. For example h$(123)=23,$ h$(025)=25,$ and h$(999)=99.$ True$/$False: Assuming the search keys are random, and the hash table is size $100,$ this hash function will favor positions towards the beginning of the hash table.