(setf G1 '( (A B 2) (B C 10) (A F 4) (A D 3)
	   (B D 13) (B E 20) (C E 11) 
	   (D E 14) (D F 16) (D G 12)
	   (E G 13) (E J 5) 
	   (F G 9) (F H 26) (F I 33) (G I 6)
	   (G J 17) (H I 15) (I J 28) ) )

(min_spanning_tree G1) => ( (A B 2) (A D 3) (A F 4) (F G 9) (G I 6)
			   (B C 10) (C E 11) (E J 5) (I H 15) 65)

(setf G2 '( (A B 2) (B C 10) (A F 54) (A D 3)
	   (B D 13) (B E 20) (C E 11) 
	   (D E 14) (D F 16) (D G 12)
	   (E G 13) (E J 5) 
	   (F G 9) (F H 26) (F I 33) (G I 6)
	   (G J 17) (H I 15) (I J 28) ) )

(min_spanning_tree G2) => ( (A B 2) (A D 3) (B C 10) (C E 11) (E J 5)
		            (D G 12) (G I 6) (G F 9) (I H 15) 73)

Note: The graph is NOT directed. 
       So an edge from A to B implies an edge from 
       B to A with the same cost. So (A B 2) should mean "there is 
       an edge BETWEEN A and B with cost 2".

Note1: The order in which the mst edges appear in the output list is 
      important. It helps me figure out how the your code executes.

Note2: You need NOT get exactly the same order as above. This is the 
       order that you get starting with A in the connected set. You 
       could start with any node you want. But the moment you decide on
       the starting node, the sequence of selected edges for the mst
       becomes fixed (provided that the node in U nearest to C has a unique
       nearest node in C). Your output should reflect this sequence,
       demonstrating that you always grow a connected tree.

Note3: Remember to use 5 as your assignment number when using submit. 
       You need to submit just the lisp file containing you code. 
       If there is something that you want me to know when I grade, 
       include a README.