Imagine that we are working on the same runway reservation system that we were working on in the classroom, and that we have received the following requests for landing reservations: These numbers are $45,50,55,65,75,85,87,95,97,105,115,118,121,$ and $125.$ If all of them fulfilled the k minute difference, which is $3$ minutes, then we should add them to the tree in such a manner that we can get the result in log$($n$)$ for the format. Display the insertion and rotation process in its entirety. Try to find a solution to the issue by using AVL Tree.

$"$if all of them fulfilled the k minute difference, which is $3$ minutes, then we should add them to the tree in such a manner that we can get the result in log$($n$)$ for the format. "for this part ensure $85$ and $87$ are not connected, $95$ and $97$ also. Make sure the AVL tree is valid