An improper tournament, or tournament with ties, is a graph in which every pair of nodes is connected by a single uniquely directed edge or by a single undirected edge. There are 1, 2, and 6 improper tournaments of orders 1, 2, and 3, respectively. How many are there of order 4? Of order n?