Data Structures and Algorithm Analysis

s 5-1 5 10 pts) Consider a hash table of size m=100 and a corresponding hash function h k m kA mod for A- pute the locations to which the keys 81 82 = 83, 84 and 85 are mapped