Consider two computer network models of the same large size, for example, $10,000$ nodes. One of these networks is a Free Scale network, and the other is a Random Graph network. Randomly select $100$ nodes as data sources, each of which generates and sends exactly one data packet. Additionally, randomly select $100$ nodes as destinations that may potentially receive some of the data packets. Assume that each data packet travels from its source to its destination via the shortest available path $($if there is more than one optimal path, the data packet randomly chooses one of them$).$

To compare the traffic performance of these two networks, one can either wait for all the sent data packets to reach their destinations and then calculate the total travel time, or one can stop the process at a specific sample time and count the number of packets that have reached their destinations by that moment.

a$)$ Assume that all nodes and all edges have unlimited betweenness. In this case, which network has better traffic performance and why? $(1$ point$)$

b$)$ Assume that all nodes and edges can handle only one data packet at a time, i$.$e$.,$ if two packets arrive at a node simultaneously, they must form a queue, resulting in a one$-$unit delay in the delivery of one of these packets. In this case, which network will have better traffic performance and why? $(1$ point$)$

c$)$ Assume that the mechanism for generating and transmitting data changes as follows: A node is randomly selected as the data source, which generates $100$ data packets $($one packet per unit time$),$ and a node is randomly selected as the destination to receive all the data packets one by one. In this new scenario, answer the questions $($a$)$ and $($b$).$