need help with these 4 questions Thank you in advance

Suppose that array a contains a heap. Array a has 100 entries. This is a max-heap. Where is the largest element of the heap? a[100] a[99] a[0] a[50] Where is the smallest element of the array a as described in the previous question? a[100] a[99] a[99] or a[98] at some element of the last row of the heap With the same heap as above, where are the two children of a[3]? The root of the heap is at a[0]. [choose 2 answers below] a[5] a[6] a[7] a[8] a[9] For a symbol table of size n implemented as an unordered linked list, what is the average time to search for a successful search? O 012 n2 n^2 \g n n n/2 Ign