Which of the statement$($s$)$ given below must be satisfied by a binary tree to become an AVL tree? $1)$ It should be a binary search tree II$)$ For any node x$,$ the height of left sub tree of x and height of right sub tree of x differ by at most $1.$ Both $(1)$ and $($II$)$ Neither $(1)$ nor $(11)$ Only $(11)$ Only $(1)$