A complete directed graph, for a given set of n vertices, is a directed graph in which every ordered pair of distinct vertices (u, v) has an edge u v. It has a total of n(n 1) edges. If we perform a depth first search in this graph, how many leaves will the resulting depth-first search tree have? If we perform a breadth first search in this graph, how many leaves will the resulting breadth-first search tree have?