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

Question Completion Status: QUESTION 1 In a max-heap, the element with the greatest key is always in the which node? O Root node O Leaf node First node of left subtree First node of right subtree QUESTION 2 Given the following method that will check if an array Ais a heap. What will the method return? public static boolean Heap (int[] a, int 1) boolean left, right: left - (A[1]