I need help fixing my code, which is given at the bottom. I amtrying to create a class for a priority (maximum) heap. I was givenall of the methods except for the add() method and the removeMax()method. The add() method is supposed to add a value while theremoveMax() method is supposed to remove the root value. You canmake trivial changes, but please do not deviate from the corealgorithm. In the main() method, I used add() to add the followingvalues in order: 1 3 2 4 6 7 8 5. Then I performed removeMax() 6times. The final tree should only have
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured