I am good with data structures and algorithms and I am able to solve all the questions listed in the project description.
1. [assume height of root node is 0] minimum elements: 2^h; Maximum elements: 2^(h+1)-1
2. Proof will be provided after we are hired.
3. In a max heap, by definition, the parent nodes contains a value greater than both its children. Hence, through recursive definition, the value of parent node will be higher than the children of its children and so on. Hence root node will have highest value in that subtree.
4. No it is not a max heap, because 7 is the child of 6 but 7 is greater.
5. h5; 3; 17; 10; 84; 19; 6; 22; 9
2(a). (1 indexed) 27 17 10 16 13 3 10 5 7 12 4 8 9 1
2(b). (1 indexed) 84 22 19 10 13 17 6 5 9
2.(c) negate each number in array and call build_max_heapy(A) on it. remove negative sign after this operation.