Show that for an AVL tree with n nodes, an insertion operation takes O$($log n$)$ time and performs O$(1)$ rotations