Fibonacci Heaps The graph below shows the Fibonacci Heaps that results after each of the insert roots.

Q1: Fibonacci Heaps The graph below shows the Fibonacci Heaps that results after each of the insert roots. - Clearly indicates tree( (H),mark(H),n,rank(X). - Show the result of insert node 15 after that delete min operation and Consolidate trees about the rank. - After that show the result of decreasing the key of x from 39 to 36 , and 26 to 4 and make sure if the heap order violated or not. Write the solution step by step