for any n$,$ there is a directed graph with n nodes, n$($n $-1)/2$ edges, and no directe cycles $($if you're stumped: for partial credit show that it is true for small values of n$).$