Which of the following statements is not true about AVL trees?

Select the correct Options:

Node's left and right subtrees cannot differ more than $1.$

AVL Trees are a not self$-$balancing Binary Search Trees.

The height of an AVL Tree always remains O $(logn)$