(Solved) : Data Structure Algorithms Asap Please Answer Completely Answer Answer Correct Thumbs Thank Q28824444 . . . .

DATA STRUCTURE AND ALGORITHMS

ASAP. Please answer completely. Answer only ifthe answer is correct for thumbs up! thank you

Consider the following two sets of keys: S = {2,5,9,11} T ={1,6,8,10,20,24}

For each of binary heap, leftist heap, skew heap, binomialqueue:

a. Show the contents of the data structure after the insertionof elements from S.

b. Show the contents of the data structure after the insertionof elements from T. This will result in a separate datastructure.

c. Show the result after merging the two data structures for Sand T. For the case of a binary heap, merge the elements from Tincrementally (successive DeleteMin operations) into S.

d.