These questions are from Data Structures. Please answer each part of the question in details as to why each of the answer correct and why the other options are wrong. Please provide details. For sufficient answer quality, I'd give a thumbs up and otherwise if the answer is short and not understood. Please explain as if you are explain the concept to a kid. Please answer all parts of the questions shown.

All operations (searching, insertion, deletion) in an AVL tree has the worst case complexity O(logn). True False Question 6 5 / 5 pts The maximum number of nodes in a binary tree with height 9 is (Please type an integer number in the following text box)