A complete, undirected, weighted graph $G$ is given on the vertex $\{0, 1,\dots, n -1\}$ for any fixed ānā. Draw the minimum spanning tree of $G$ if
the weight of the edge $(u, v)$ is $\mid u-v\mid$
the weight of the edge $(u, v)$ is $u + v$
Application of this question has been asked in GATE 2020.
https://gateoverflow.in/333182/gate-2020-cse-question-49
Line Graph is different from Path Graph.
Here it represents Path Graph for option (A).
https://en.wikipedia.org/wiki/Path_graph
https://en.wikipedia.org/wiki/Line_graph
$\text{(A)}$
$\text{(B)}$