PLEASE HELP WITH THIS ALL QUESTION

Given this Tree, answer the following questions 101 index: 0 48 98 index: 1 index: 2 30 34 85 88 index: 3 index: 4 index: 5 index: 6 1 29 index: 7 index: 8 NOTE THAT THIS BINARY TREE IS REPRESENTED AS AN ARRAY LIKE THIS: [101, 48, 98, 30, 34, 85, 88, 1, 29] Q5. Is this a heap? Yes it is max heap . Yes it is a min heap No it is not a heap Now say we added 53 to this supposed heap. Answer the following questions. If the above tree is not a heap, put "Not a heap" instead. Q6. Describe where we insert the 53 initially. Q7. Describe the swaps that take place during the add. Q8. Describe what the resulting heap would look like, in the array format provided above