Create a rooted tree where each tower is a node, and the edges between them  represent the network connections. The root node of the tree represents  the central hub of the network. You need to design the tree such that  the network connections are optimized for maximum efficiency, and each  tower is connected to the root node in the most direct way possible

no of towers = 22

 we should use the Kruskal’s Algorithm- Minimum Spanning Tree and then we make the rooted tree with it draw it