Q1- For the items in the 5-element table below, compute hash_fcn(key) % table.size() for table sizes of 8 and 13. What would be the position of each item in tables of these sizes using open addressing and chaining? Name hash_fun() "Kim" 84274 "Adam" 2129869 "John" 69496448 "Steve" 82879 "Ali" 2484038 "Sarah" 10003 "Tom" 2222227 "Messi" 8123991 Q2- Compare the storage requirement for a hash table with open addressing, a table size of 500, and a load factor of 0.5 with a hash table that uses chaining and gives the same performance.