Which of the following is a disadvantage of AVL trees compared to standard binary search treesThey require more space to store balance factorsThey have slower insertion and deletion operations due to rebalancingThey are less efficient in terms of memory usageThey cannot be efficiently implemented using recursion