i need the MCQ answers

9. A hash table has an array size of 512. If we use open addressing and linear probing, the load factor is 0.5, What is the maximum number of entries that can be placed in the table? A. 256 B. 511 C. 512 D. There is no maximum 10. A hash function h defined h(key)= key mod7, with linear probing, is used to insert the keys 44,45,79,55,91, 18,63 into a table indexed from 0 to 6 . What will be the location of key 18? A. 3 B. 4 C. 5 D. 6 11. Which of the traversals in binary search tree gives sorted list A. Post-order. B. Pre-order C. In-order D. level-order 12. In the right tree, how many of the nodes have sibling? A. 3 B. 4 C. 5 D. 6 13. Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the left child's value be stored? ( ). A. data [i+1] B. data [i+2] C. data[2i+1] D. data[2*i ] 14. Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is ( ) A.E B. 2E C. V D. 2V 15. What is the worst-case run-time complexity of binary search algorithm? A. O(logn) B. O(n) C. O(nlogn) D. (n2)