A gas company is planning to layout is gas pipeline through the district. District has main cities $\{A,B,C,D,E,F,G,H,$I,$J\}.$ You are tasked to find minimum length of pipeline that connects all cities. Given is the table of cities and their respective distances.

A$)$ Apply Suitable Algorithm for finding the minimum length of pipeline.

B$)$ Provide stepwise solution of given data for above problem

$\backslash$table$[[,$Source,Destination,Distance$],[1,$A$,$B$,6],[2,$A$,$F$,13],[3,$B$,$C$,18],[4,$B$,$E$,17],[5,$B$,$D$,18],[6,$C$,$G$,15],[7,$D$,$F$,20],[8,$D$,$H$,19],[9,$D$,$E$,20],[10,$E$,$G$,9],[11,$E$,$I,$7],[12,$F$,$H$,16],[13,$G$,$I,$10],[14,$H$,$I,$12],[15,$H$,$J$,11],[16,$I,J$,10]]$