in Python
12. (10 points) Write a method that receives a heap H and determines if there is at least one element in the heap that is equal to its sibling 13. (6 points) Consider the array S (-1,0,1,2,3,4,5,6) . S how the set of disjoint sets (that is, the forest of trees), encoded by S . . Suppose the find operation uses path compression. What is the resulting configuration of s (show array and forest of trees) after performing the operation find(S,5)