Answer the following questions on hash tables (16pts total a. Using the following prehash method: [6pts] prehash (3) length (8) the number of letters Take the value returned by the prehash method and run it through the division hash method to get the bucket index. Then insert the item into the hash table below. Use chaining for collision resolution. Make sure to show the null values. Here are the items you are to insert: . IT . Food . FizzyBuzzy . The . O H 2 3 Cook Luck b. What is the load factor (aka a) of the hash table above? State the formula used to calculate the load factor first, then plug in the right numbers and show the resulting load factor. [1pt] bluorie Cas Blodz 3 now tol c. What does the load factor tell us about a hash table that uses chaining? [1pt]