Decision tree can be used to prove the lower bound complexity for general comparison$-$based sorting algorithms.

Which of the following statements is FALSE regarding this analysis of the lower bound?

Decision tree can be used to prove the lower bound complexity for general comparison$-$based sorting algorithms.

Which of the following statements is FALSE regarding this analysis of the lower bound?

The number of leaf nodes in the decision tree is

$,$ where

is the number of data to be sorted

Stirling approximation is used to approximate

by

Each leaf in the decision tree represents an ordering of

data items, and there are

different orderings of

elements.

InsertionSort should never be used in practice, because its worse$-$case complexity is

and it is suboptimal