points Consider a full binary search tree, T of depth d. The length of a path in a tree between two nodes u, is the number of edges between them (equivalently: the number of nodes, including u, v minus1) (a) In terms of d, how many nodes does T have? (b) In terms of d, how long is a path from the root of T to any one of its leaves? (c) In terms of d, what is the longest possible path in T? 2.6 13.4 points Say that we want to insert integers 1 thru 15 into a binary search tree one by one. What order would we have to insert these elements for it to result in a full and balanced binary search tree