Write a computer program that adds k sequential LLs in an N-node network based on the maximum average betweenness centrality difference (MaxABCD) strategy. In MaxABCD, an LL is added between a node pair such that the resultant network BC shows maximum differ- ence with respect to the mean BC value of the network. Also estimate the time complexity to execute MaxABCD.

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.