Describe how to construct a directed graph with n vertices, and how to choose where to start a search in the graph and what order to visit the children of each vertex in the search, so that a depth-first search in your graph has a tree with n-1 leaves, while a breadth-first search in the same graph has a tree with only one leaf. Hint: the two searches do not need to start from the same vertex as each other.