$**$Not sure about this question$**$

An algorithm has three nested for$-$loops, and within the inner$-$most loop, it is performing

a binary search. Which of the following best describes its asymptotic running time?

A$.O(n^3)$

B$.O(3n)$

C$.O(n^{3}lgn)$

D$.O(nlgn)$