In solving problems largest group of priority queue type branch threshold method, the current expansion node meet cn + n - t>=bestn right son nodes are inserted into the priority queue. If the condition to satisfy the cn + n - t> Bestn right son nodes inserted into the priority queue can still meet the algorithm is correct? Why is that?