In the following consensus protocol tree, there are eleven states. Indicate, for each state, if that state is critical (C), bivalent (B), univalent(U) 1-valent (1-V), 0-valent (0-V), and nal (F). Of course, some states may have more than one entry. Final states should be marked with an F and no other letter. 10 Consider the following tree. Is the tree a valid tree for a two-thread binary consensus protocol? Prove why it is or is not. You may use lemmas or theorems from the text In the following consensus protocol tree, there are eleven states. Indicate, for each state, if that state is critical (C), bivalent (B), univalent(U) 1-valent (1-V), 0-valent (0-V), and nal (F). Of course, some states may have more than one entry. Final states should be marked with an F and no other letter. 10 Consider the following tree. Is the tree a valid tree for a two-thread binary consensus protocol? Prove why it is or is not. You may use lemmas or theorems from the text