Can someone do part 1 and 5

Given a hash table with 150 buckets, assume you are trying to insert two tuples, one with a tuple with a key value of 102, and one with a key value of 153. Determine the index of the bucket for each tuple for the following hash functions. Assume you would use the smallest R possible when appropriate, that you would select the left most middle digits if you cannot evenly extra R digits (i.e. if R is 2 and your squared key value is 34567 you would choose 45), and your hash multiplier is 5 1. Modulo Hash 2. Mid-Square Hash (base 10) 3. Mid-Square Hash (base 2) 4. Multiplicative String Hash ('0%48,'1' 492':50,'3-51,,5-53) 5. Direct Hash