All of these remarks also apply to the applications of (I), (J), and (K); these do not occur in the input tree, and the algorithm must make a choice somehow.
we do not know the worst-case complexity of our algorithm.