2why wowld you use the NEULE pointer to find ehe end of a ist rather thon rely on the count in the meto duto? fone sentence) (.S points) e hash "oble what are the 2 bese types of d to structures we combine to create the corplete teble ? 1 point) 4 in a hash table whot do you use the hash value for? (.s point) lf we set x to be an int as in points) s int x-5; what does the command &(x) return? Cs 6. Whot does (&(x)) return ?Y.5 points) 7. When inserting into a linked list at the front of the Wst what must you do to prevent losing a pointer fi points) a. Make a copy of header dot front before inserting the new node b. Make a copy of header dot rear before inserting the new node e. Make a copy of new pointer before inserting the new node d. Make a copy of header dot front dot next before inserting the new node e. You do not need to do any of these tings (Tor F) A selection operator in a structure uses the selector when the structure is being referenced by a pointer and the dot selection operator when the structure is being referenced by its name (1 point) 8. 9. (Tor F) The hash table contains an array of pointers to the lists it contains. (1 point) 10. (T or F) The malloc command does not require the size of the memory it is pointing to (1 point)