The configuration model is a model for random graphs that works in the following way. You start with an arbitrary network with N nodes. For each of these nodes find the value of its degree. Now, in order to generate another network, you reconnect the links at random such that the degree of each node remains the same. There are no additional restrictions. a) 1 Write a pseudo-code that would implement this algorithm starting with a given graph where the nodes have degree {k, k2, ..., ky}. The pseudo-code has to have enough details for a reader to reproduce the algorithm. For instance, you should specify which variables are being used to store information, initial values and how they are modified during the implementation of the algorithm. b) Explain what kind of graphs you could obtain by using this model (directed/undirected, connected/disconnected, simple graphs, multi-graphs?) c) Assume that you are provided a list {k, k, ..., ky} with arbitrary integer values. Is there any case in which this list cannot represent an actual network? If yes, provide an example of a list of degrees that cannot correspond to an actual network and explain why it cannot exist. If not, justify carefully why it should always be possible.