brother it is a described question please tell me what type of info required

please read thoroughly question no 2 i need complete solution

first part determine the two descriptors

second part determine the descriptor for the heap (n+k) that part

3rd one showing using clear illustrations how to shape ( not the heap order ) of given heap will created from input heaps

hope you got now

a single sorted list containing the elements of all k lists in time O(nlogh). 2. (6 pts) You are given two input heaps, called n-heap, and k-heap, on n = 26 and k 13 elements, respectively. Determine the two descriptors. Then, determine the descriptor for the heap, called (n +k)- heap that arises when merging the two heaps. Show using clear illustrations how the shape (not the heap order) of (n+k) heap will be created from the input heaps. 3, (6 pts) Establish a recurrence relation to count the number of distinct heaps on n (distinct) elements, You do