For the statement below, indicate whether it is True $($T$)$ or False $($F$).$ You should justify your choice to receive full credit.

Binary insertion sorting $($insertion sort that uses binary search to find each insertion point$)$ requires O$($nlogn$)$ total operations.