True or false

1-In a max-heap, the element with the greatest key is always in the right-most leaf.

2-Faster access of data is the advantage of a hash table as a data structure.

3-In a binary min heap containing n numbers, the smallest element can be found in O(1).

4-The data structure used for Breadth First Search on graph is stack.

5-Increasing hash table size is a technique to avoid a collision.