If you were going to use a proof by contradiction to prove the

following theorem, which of these would be the appropriate

assumption to make? $($You likely will not understand the statement.

Nonetheless, you should be able to answer correctly.$)$

Every subtree contains at least one node with a value larger

than the value in this node.

A$.$ Every subtree contains at least one node with a value larger

than the value in this node.

B$.$ Some subtree contains at least one node with a value larger

than the value in this node.

C$.$ Some subtree contains no nodes with values larger than the

value in this node.

D$.$ No subtree contains at least one node with a value larger

than the value in this node.

E$.$ It is not possible to proof this using a contrapositive proof.