According to the recurrence relation of the time complexity of Tower of Hanoi, $T(n) = 2 T( n-1 ) +1,$ we get it is $\Theta(2^n)$
Now, heap sort worst case time complexity is $\Theta(n \log n)$
Binary Search to search an element given $n$ sorted numbers is $\Theta(\log n)$
Addition of two $n\times n$ matrices is $\Theta(n^2)$
So, C is correct answer here.