Consider picking a tree out of the set of possible binary search trees on the keys $1,2,...,$ n$,$with each tree equally likely. Let p$($T$)$ be the probability of obtaining a particular tree T in this way. In$$class$,$ we considered generating a binary search tree by inserting the numbers $1,2,...,$ n in random order.$$Let q$($T$)$ be the probability of obtaining the tree T in this way. Provide an example showing that p$($T$)$ is$$not necessarily equal to q$($T$),$ and explain why.