Write a method that receives an integer key k and a hash table H that resolves collisions by chaining and inserts k into H. Assume h(k) = k % tableSize. Include a method that prints the running time (using currentTimeMillis) of the original method for a hash table with n elements.