| Week | \(1\) | \(2\) | \(3\) | \(4\) | \(5\) |
| No. of Telephone calls | \(110\) | \(130\) | \(93\) | \(104\) | \(211\) |




| Week | \(1\) | \(2\) | \(3\) | \(4\) | \(5\) |
| Calls (in thousands) | \(110\) | \(130\) | \(93\) | \(104\) | \(211\) |
Suppose a minimum spanning tree is to be generated for a graph whose edge weights are given below. Identify the graph which represents a valid minimum spanning tree?
\[\begin{array}{|c|c|}\hline \text{Edges through Vertex points} & \text{Weight of the corresponding Edge} \\ \hline (1,2) & 11 \\ \hline (3,6) & 14 \\ \hline (4,6) & 21 \\ \hline (2,6) & 24 \\ \hline (1,4) & 31 \\ \hline (3,5) & 36 \\ \hline \end{array}\]
Choose the correct answer from the options given below:
Match LIST-I with LIST-II

Choose the correct answer from the options given below: