Consider the example string network in Figure 4.5 where only five nodes are shown. Write a program to create a similar topology of 40 nodes. Apply the SDLA algorithm to add five LLs. Also apply the MinAPL, MaxBC, and MaxCC strategies to add the same number of LLs. Compare APL values after adding each LL with the above strategies. What is the percentage deviation for each APL value? Also compare the execution time of these algorithms. Comment on overall performance of all the strategies.

This is a computer simulation problem. Some Matlab code fractions available for simulations can be found at https://complexnetworksbook.github.io