Can you help me solve the java problem?

Is this an AVL tree? Choose the one that best describes why 20 10 30 4 16 3 7 O Yes, because the left and right subtrees of every node have heights differing by at most 1 No, because at node "20" the left subtree "10" and right subtree "30" differ by more than 1. No, because at node "10" the left subtree "4" and right subtree "16" differ by more than 1 O Yes, because at node "20" the left subtree "10" and right subtree "30" have the same height. No, because at node "30" the right subtree "null" and at node 10 the right subtree "16" differ by more than 1 O Yes, because the shortest subtree at node "10" and the shortest subtree at node "30" differ by at most 1