If a max heap is implemented using a partially filled array-03410

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n >0), where is the entry with the greatest value?

This multiple choice question (MCQ) is related to the book/course vu cs301 Data Structures. It can also be found in vu cs301 Final Term - Quiz No.11.