Consider an empty AVL Tree built by inserting the following sequence of integers, one at a time, in the given order: $60,70,50,55,65,75,80,45.$ Which of the following statements is true about the tree? Points will be deducted for each incorrect response; however, negative scoring will not be applied.

Question $3$Select one or more:

$55$s right child is $65$ and $75$s left child is NULL.

$45$s right child is NULL and $60$s left child is $50.$

None of the listed answers is correct.

$50$s right child is $55$ and $70$s left child is $60.$

$60$s right child is $65$ and $70$s left child is NULL.

$55$s left child is $50$ and $70$s right child is $75.$

$56$s right child is $70$ and $70$s left child is $65.$

$65$s left child is $60$ and $75$s right child is $80.$