Need help checking a python program.
[10 pts] In our video lecture, we discussed the abstract datatype Binary Heap. A binary heap is a complete binary tree whichsatisfies the heap ordering property and can be implemented with anarray. When using a binary heap to implement a priority queue, wewill always have the element with the highest (or lowest) priorityin the root node of the heap. Implement the classMaxHeapPriorityQueue as a heap with the following operations: •MaxHeapPriorityQueue() creates a new heap that is empty. It needsno parameters and returns nothing. Note that as discussed in thevideo lecture, the index range of the
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured