Answer
$N-1$ connections
Work Step by Step
We can just connect first node to second node and then second node to third node and so on, this will require N-1 connections and all the nodes will be connected. We can prove that this is the minimum number of connections by arguing that even if we remove any one connection some of the nodes will be disconnected, so we can say that this configuration has minimum number of nodes.
