Problem 4 (35 points). Consider a network with n nodes, constructed as follows (see figure in the back of this page): 1. Arrange n - 1 nodes in a circular array and locate another node at the center of the array, 2. Connect the central node to all other nodes in the circular array, and label the central node as node 1. 3. Connect each one of the n-1 nodes in the circular array to its 2s closest neighbors in the array, i.e., to its s neighbors clockwise and its s counterclockwise (see the figure below for the particular case of s =2). S=2 2 3 4 1h-1 5 6 Problem 4 (35 points). Consider a network with n nodes, constructed as follows (see figure in the back of this page): 1. Arrange n - 1 nodes in a circular array and locate another node at the center of the array, 2. Connect the central node to all other nodes in the circular array, and label the central node as node 1. 3. Connect each one of the n-1 nodes in the circular array to its 2s closest neighbors in the array, i.e., to its s neighbors clockwise and its s counterclockwise (see the figure below for the particular case of s =2). S=2 2 3 4 1h-1 5 6