c++

6. (A). Using the "modulo division" method and linked list collision resolution, store the keys shown below in an array of 5 elements. Each element has two fields: data and link. What is the load factor? 48, 79, 49, 28, 39, 58 4 Load Factor (B). A simple hash function is given below? Is it good? Defend your answer. Algorithm hash( string key, int size loop (not end of key) sum key[ikey[i] *key[i]; i+ti end loop return sum % size; end hash