Algorithm

Please answer and write it clearly

thanks

A d-ary heap is like the binary heaps that we studied in class, except that the corresponding heap structure is a d-ary tree (d > 2) rather than a binary tree. Heapsort can be implemented using a d-ary heap in much the same way that we implemented heapsort using a binary heap. We may refer to such heapsort algorithms as d-ary heapsort and binary heapsort respectively. Circle one, and justify your answer on the back of this page "If the functions T_2(N) and T_d(N) give the worst-case running times (as a function of the number N of elements in the array being sorted) of a binary heapsort and a d-ary heapsort respectively, then T_2(N) and T_d(N) lie in different Theta classes