資料結構與演算法(A)

(5 points) In a max-heap stored in an array, after these 6 numbers have been inserted in this exact sequence: $5, 4, 2, 6, 1, 3$, what is the value of the node at index 2 (with the root being the node at index 1)?