5 marks (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 IVI and IEl respectively. The graph G is said to be clean if the nodes do not know the topology of the graph. A Link State routing protocol requires knowledge about the link states of the network. State the messaging complexity required to gather this information. Justify this expression. 5 marks] (d) The Internet supports two transport protocols: UDP and TCP. Give three applications that use UDP and three applications that use TCP. Outline why TCP or UDP is the appropriate transport layer protocol for each application