In Java

Provide a brief, but complete answer to each question: How can we create a Hash table that completely avoids collisions? Is this a good idea? a. b. What is the smallest number of nodes in a complete binary tree with depth 5? c. Should "dummy" nodes be included when counting the elements in a list? Why or why not? d. Is it true that the bottom level in a complete ascending Heap contains only the larger half of the values, i.e., the elements with values that are greater or equal to the median? Why or why not? Will the result of the addition of two sparse matrices also be sparse? Why or why not? Why it is important for a Hash Table to have extra space for the elements. What happens when there is not enough extra space? Is an array the only choice when implementing a Heap? Why or why not? e. f. h. Will the smallest-valued e in an ascending Heap always have two children. Why or why not? nod