# (Solved) : Suppose Following B Tree K 2 Maximum Number Keys Node 3 Keys Single Characters Show Tree Q38844475 . . .

\$9.00

a. Suppose I have the following B-Tree with K=2 (so the maximumnumber of keys in a node is 3), with keys as single characters:Show the tree that results from inserting a “P” into tree b. Suppose I had inserted the numbers 1-7 into a Fibonacci Heap.Recall that insert just adds each node to the rootlist at the toplevel, so I’d have just a linked list of the numbers 1-7: Recallthat in doing the extract-min operation, we consolidate the heap.Show the result of the Fibonacci heap after extracting the min andconsolidation. You may want to show intermediate steps as well- themore you show of how the algorithm works, the more partial credit Ican give you if something goes wrong. DHL А ВС EF G I JK M N O adds each node to the rootlist at the top level, sc numbers 1-7: Min 4 7 1 2 3 5 6 that in doing the extract-min operation, we consolidate th Show transcribed image text DHL А ВС EF G I JK M N O
adds each node to the rootlist at the top level, sc numbers 1-7: Min 4 7 1 2 3 5 6 that in doing the extract-min operation, we consolidate th

a. Suppose I have the following B-Tree with K=2 (so the maximumnumber of keys in a node is 3), with keys as single characters:Show the tree that results from inserting a “P” into tree 