Tick all the statements that are true about this binary tree: 12 13 0 11 15 5 10 14 This binary tree is balanced The height of the tree is 5 If the search convention is that the left child is searched before the right child, then vertex 13 is reached in a breadth first search before vertex 2 The height of the tree is 4 If the search convention is that the left child is searched before the right child, then vertex 4 is reached in a depth first search before vertex 9 0 This binary tree is regular (full)