Let G = (V, E) be a simple undirected connected graph with some weight function w that assigns any real weight (positive or negative) to all edges.

(i) Describe an algorithm to find a spanning subgraph of G of minimum weight. Prove correctness of your algorithms and show what its run time is.

(ii) Show that if all edges in G have pairwise different weights then G must have a unique minimum spanning tree.