Let a max$-$heap be stored in array A from index $1$ to index $n.$ Is $A[n]$ guaranteed to be the

smallest element?

No

Yes