Data Structure, HELP PLEASE & just give me the final answer

Q1

Q2

Q3

Which of the following is a heap tree? 10 (A) 10 (B) 2 2 10 (C) (D) 2 1 6 10 A heap can be used as decreasing order array O priority queue O stack binary search Consider a hash table with size 11 using double hashing the hash function is hy(k) - k mod 11 and the second hash function is halk) = 1+(k mod 9) For kay na, ir the hash value from his already occupied 98 will be probed to index 0 11 10