Answer Happy

please do it with python, i dont have idea
Program 0: Heap check Give a sequence of inputs of white-space separated integers output either Yes or No depend- ing if it represents a maximum heap. Each line of the input corresponds to a different test case. Recall we use array sequence representation for binary trees (heaps). Sample input: Sample output: 3 1 2 1 2 3 5 4 3 3 7 5 4 2 3 5 5 4 4 5 6 4 4 5 4 Yes No Yes Yes Yes No