Java -  In hash tables, separate chaining requires less memory than open addressing. True or False?

I am having a hard time finding the right approach for the question. I need a justified answer. Could you please help me through?

How many linked lists are there in a chaining hash table of size T? What is/are the elementary data structure(s) used in Separate Chaining hash table?

For every block chain, what information is always registered within every block? (a)The previous block is hash, (b)The current block is hash, (c)The next block is hash, (d) all the previous block is hash?

The components that determine a hash table's Big-O performance are listed below in decreasing order of importance:

If two different keys are hashed to the same location in a too-full hash table (A-1), what will be done by the Open Addressing technique? The table size is doubled (and rehashed) in order to accommodate the keys. Alternative cells are tried until an empty cell is found in the neighborhood. They are chained in two different linked lists at that location. They are chained in the same linked list at that location.

Describe Hashing. (Hashing, hash table, collision detection, temporal complexity, hashing applications). Detail a hashing use. Does Java have a library for this?

Java- What kind of initialization needs to be done for an open-address hash table? What about a chained hash table?

Hashing notes should be thorough. (Hashing, hash tables, collision, collision detection algorithms, temporal complexity, and hashing applications). Explain a hashing application. Do you have any recommendations for Java libraries?

Java programming Computer science Please please help me