We wish to find the largest element in a min-heap represented by array A[1]... A[n]. Show using a series of examples for n=7 that any element starting from ceil(n/2) can be the largest element. Your answer should be in the form of 4 min heaps.