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?

(A) data[0]
(B) data[n-1]
(C) data[n]
(D) data[2*n+1]