
The first node without a priority would be chosen as the candidate master and the rest would be ignored. The code must check if neither of the two nodes have priorities and if so must choose the better one.
The first node without a priority would be chosen as the candidate master and the rest would be ignored. The code must check if neither of the two nodes have priorities and if so must choose the better one.