Assume an AVL tree topology of height 6 (from depth level 0 to 5) with a minimum number of nodes. a) How many such binary tree topologies (not only AVL tree topologies but also those ) are there provided that the number of nodes at each depth level remains constant? Show one sample AVL tree topology. b) How many binary tree topologies (NOT AVL tree topologies) are there with the same total search time or internal path length