Please use Python 3

3 (a) Consider the following ordered sequence of values to be added to a max-heap: 4, 8, 6, 5,7, 9 Sketch the heap after adding each value and re-heapifying 3 (b) Consider the following implementation of third_largest, which is intended to return the third largest value from a max-heap (assuming the heap contains at least three values): class Heap: def _init _(self): self.data- def third_largest(self): if self.data[1] > self.data [2]: return self.data[2] else: return self.data[1] The method does not work reliably, however. Sketch a valid max-heap for which the above implementation fails