Describe 2-3 trees (give a definition and an example). Explain how search, insertion and deletion are performed on 2-3 trees (use an example), and how an efficiency of 2-3 trees compares to that of AVL trees? (again, an example will be useful to illustrate your answer).