Suppose that every connection requires $2$ consecutive hops, and calls are connected clockwise. For example, a connection can go from A to C$,$ from B to D$,$ from C to A$,$ and from D to B$.$ With these constraints, what is the is the maximum number of connections that can be ongoing in the network at any one time?Suppose that every connection requires $2$ consecutive hops, and calls are connected clockwise. For example, a connection can go from A to C$,$ from B to D$,$ from C to A$,$ and from D to B$.$ With these constraints, what is the is the maximum number of connections that can be ongoing in the network at any one time?