(a) Build a Max heap on the array containing in this order) A] = {5,5, 20, 64, 17, 10, 25, 19}. Show the heap after the last two calls to Max Heapify. (b) Perform Extract-Max on the heap obtained in the previous question. Show two-three steps. Only show the parts of the heap that are modified. (c) Perform Insert(99) on the heap obtained in the previous question. (d) You are given a SkipList for a set S of keys. Each cell v also stores a field v + size. This field maintains the number of keys of S which > V + key and also