For this assignment we use adjacency matrices with positive integer weights. Here a zero entry at row i and column j indicates that no edge ij exists in the graph. The first line consists of an integer n 1000 denoting the order of the graph. This is then followed by n lines of n white-space separated integers denoting edge weights. The sequence of graphs is teminated by a value n-0, which is not processed. 01 3 102 3 2 0 0 27 0 205 1 7 5 0 3 01 3 0 01040 0 10 3 0 3 0 0300 0 2 4000 2 0 030 2 01 00 20 1 0 Output Format Output should be one line for each input graph indicating the minimum cost weighted tree. The sample output for the previous input cases is as follows