46. Consider a Fibonacci heap that results from successively inseting 929 (distinct) keys into an initially empty heap. followedby deleting the minin imum key. Which of the following statements are true?
(A) The Fibonacci heap is of degree 9.
(B) The Fibonacci heap is of height 12.
(C) There are 5 trees in the Fibonacci heap.
(D) With one additional decrease key operation, the Fibonacci heap can have 6 trees.
(E) With two additiunal dourcase key uperations, the Fibonacct heap can have 7 trees.