Please solve all of them with explanation. thanks

Review: Hashing Techniques 1. A hashing function converts a large to a small 2. A occurs when two keys hash to the same address. 3. For an open hashing scheme, the records within each bucket are stored in key order ( true / false). 4. For an open hashing scheme, the most recently inserted record will be on the front end of the bucket list ( true / false). 5. An open hashing scheme requires the use of random access ( true / false ). 6. A good hashing function should the buckets. distribute the records among 7. For an open hashing scheme with 100 buckets and 4000 records, the average number of record reads to locate a record is equal to 8. Given the following hash function for storing records on courses: f(title) = ASCII value of first character in the title 64 Example: f(Biology I) 66 - 65 = 1 (ASCII value of B is 66) a. Explain why this is or is not a good hash function. b. What improvement(s) could be made? 9. Assume that the hash function is: f(key) key%B a. What is the problem if B is too small? b. What is the problem if B is too large? c. What is the big-0 run-time if there are n records? d. What does the run-time for a find, insert, and delete each approach as B gets very large