D-ary heap and Binary heap

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 True or False? If the functions T2(N) and Td(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 T2(N) and Td(N) lie in different big theta classes. Justify your