Dear chegg team,

please solve these questions on paper and draw most and trees from the first question.

1. Create an Interval Heap, B-Tree(order 5), B+ tree(order 7), Binomial Heap and Fibonacci Heap from the following values. (10) 4,6,12,8,9,21,2,22,123,241,100,1,99 and 98 2. Suppose that a MST of the following edge-weighted graph contains the edges with weights x. y and z (4) Which one or more of the following can be the values of x,y and z