8. in method 3 in DSS we used array of heights and merging ofthe trees is accomplished by this array ( we merged the lowest treeto the highest tree ).
Assuming that instead array of heights we will use array ofsize, that will save the number of nodes for each tree and the newmerge will be accomplished by this array of size in the same wayfrom the smallest tree to the biggest tree.
a. write merge3 function that will implement this method.
b. Can you block the height of the tree according tothis approach?
c. what is the complexity of merge3 in this approach ?
Defined
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured