Let T be an AVL tree with n elements. Direct each edge of T from parent to child to form a directed graph G with n vertices and n$-1$ directed edges. Then the transitive closure of G has $\backslash$Theta $(\_\_\_\_\_\_\_\_\_\_\_\_\_)$ edges.