(c) A graph G is composed of a set of vertices, V, and a set of edges, E. The number of vertices and edges is denoted |V| and \El respectively. The graph G is said to be clean if the nodes do not know the topology of the graph. A Link State routing requires knowledge about the link states of the network. State the messaging complexity required to gather this information. Justify this expression. [5 marks]