We insert a sequence of nodes with the following keys in an empty binary search tree: $5,7,6,3,1,2.$ Indicate what of the following sentences is talse for the subtree that has key $3$ as root.

It is a complete binary search tree.

It is a binary search tree.

Height $=2.$

Size $=3$