Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?
A man calls his dog from the opposite side of a river. The dog crosses the river without a bridge or a boat and manages to not get wet. How is this possible?