Tournament Construction

You are given $2$ integers $N$ and $D$. Please construct a tournament graph on $N$ vertices such that the diameter is exactly $D$, or report that it is impossible. --- A tournament graph is a directed graph such that for every pair of vertices $(X, Y)$ ($X \ne Y$), there exists **exactly one** of the edges $X \rightarrow Y$ or $Y \rightarrow X$. There are no other edges in the graph. The diam