True/False I know chegg says one question per if you would be willing to answer all of them I greatly appreciate it, if not just let me know which one you answered and Ill update a new post with the remaining questions. Thank you very much!

[ ] In disjoint set forest representation, Union by rank makes a tree with more nodes point to a tree with fewer nodes.

[ ] In matrix-chain multiplication, if all the matrices are square matrices, any parenthesization will require the same total number of scalar multiplications.

[ ] If a node in a binary search tree has two children, its successor cannot have left child.

[ ] The height of any binary search tree with n nodes is O(logn).

[ ] The 5-step algorithm SELECT(A, k) for determining the kth smallest element of array A of size n has an O(n) complexity when the group size is 3. [ ] In Open Addressing, the loading factor is always 1.

[ ] The only value A that works for the hash function h(k) = m (kA mod 1 ) is A = (5 1)/2