Describe the process of sequentially performing the following operations on the Fibonacci heap in Fig. 1: decrease-key (7, 1); extract-min(); min 2 0 3 5 9 8 7 6 Fig. 1 b) (10%) Given a Fibonacci heap with 0, 1, 2, ..., n keys (n 1), consisting of a horizontal chain with alternating marked nodes, starting at an unmarked node with key 0. How many marked nodes will the resulting tree have after deleting the node with key 0? Justify your answer. Activate