Write a computer program to implement the following LL addition heuristics: generate a random network with probability p = 0 .2. Assign weight to each link based on the normal distribution. Add 10 LLs between node pairs such that the ANFC value of the network is maximized. The weights of the added LLs are fixed and equal to the maximum weight of the NLs present in the network. Estimate the time complexity and the ANFC value after each LL addition. Make necessary assumptions.

What will be an ideal response?

This problem is a computer-based exercise. Some Matlab code fractions available for simula-
tions can be found at https://complexnetworksbook.github.io.